Minimum Difficulty

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll n;
    cin>>n;
    ll a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    vector<ll> ans;
    for(int i=1;i<n-1;i++){
        vector<ll> v;
        //cout<<i<<endl;
        for(int k=0,j=1;j<n;k++,j++){
                if(k==i){
                    //cout<<a[j]-a[k-1]<<" "<<a[j]<<" "<<a[k-1]<<" "<<"k==i"<<endl;
                    v.push_back(a[j]-a[k-1]);
                }
                else if(j==i){
                    //cout<<a[j+1]-a[k]<<" "<<a[j+1]<<" "<<a[k]<<" "<<"j==i"<<endl;
                    v.push_back(a[j+1]-a[k]);
                    j++;
                    k++;
                }
                else{
                    //cout<<a[j]-a[k]<<" "<<a[j]<<" "<<a[k]<<" "<<"else"<<endl;
                    v.push_back(a[j]-a[k]);
                }
        }
        sort(v.begin(),v.end(),greater<ll>());
        ans.push_back(v[0]);
        //cout<<v[0]<<endl;
        v.clear();
    }
    sort(ans.begin(),ans.end());
    cout<<ans[0]<<endl;
}