Submission #11204723

---

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>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
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 Per(i,sta,n) for(int i=n-1;i>=sta;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 long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n;
ll a[1010],S[1010];
int dp[2][1010];

void solve(){
    cin >> n;
    ll l=-INF,r=INF;
    rep(i,n){
        cin >> a[i];
        S[i+1]=S[i]+a[i];
    }
    while(r-l>1){
        ll mid=(r+l)/2;
        //cout << mid << endl;
        rep(i,n){
            dp[0][i]=mod;
            dp[1][i]=-mod;
        }
        dp[0][n]=0;
        dp[1][n]=0;
        per(i,n){
            Rep(j,i+1,n+1){
                int f;
                if(S[j]-S[i]>=mid) f=1;
                else f=-1;
                dp[0][i]=min(dp[0][i],dp[1][j]-f);
                dp[1][i]=max(dp[1][i],dp[0][j]-f);
            }
        }

        // rep(k,2){
        //     rep(i,n+1){
        //         cout << k << " " << i << " " << dp[k][i] << endl;
        //     }
        // }
        if(dp[0][0]>=0) r=mid;
        else l=mid;
    }
    cout << l << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}

Submission Info

Judge Result