Submission #5947219

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back

void Yes(){
	cout<<"Yes"<<endl;
	exit(0);
}
 
void No(){
	cout<<"No"<<endl;
	exit(0);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
    int N; cin >> N;
    ll A[200200], B[200200];
    B[0] = 0;
    rep(i, N) {
        cin >> A[i];
        B[i + 1] = B[i] + A[i] * 2;
    }
    ll ans = INF;
    Rep(i, 2, N - 2) {
        ll X = B[i], Y = B[N] - B[i];
        ll P = *(lower_bound(B, B + N, X / 2));
        ll Q = X - P;
        ll R = *(lower_bound(B, B + N, X + Y / 2)) - X;
        ll S = Y - R;
        P /= 2; Q /= 2; R /= 2; S /= 2;
        ll Z[4]; Z[0] = P; Z[1] = Q; Z[2] = R; Z[3] = S;
        sort(Z, Z + 4);
        ll res = Z[3] - Z[0];
        ans = min(ans, res);
    }
    cout << ans << endl;
	return 0;
}

Submission Info

Judge Result