小阳买水果

https://ac.nowcoder.com/acm/contest/949/D 

反思：没想到要跳到最长。。。 

 

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}
//----------------------------------------------------------


const int maxn=2e6+9;
const int mod=1e9+7;

int sum[maxn];
int maxx[maxn];
int n;

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);

    cin>>n;
    for(int i=1;i<=n;i++) cin>>sum[i],sum[i]+=sum[i-1];
    maxx[n]=sum[n];
    for(int i=n-1;i>=1;i--) maxx[i]=max(maxx[i+1],sum[i]);
    int ans=0;
    for(int l=1,r=1;l<=n&&r<=n;l++,r++)
    {
        if(maxx[r]<=sum[l-1]) continue;
        while(r<=n&&maxx[r]-sum[l-1]>0) r++;
        ans=max(ans,r-l);
    }
    cout<<ans<<endl;

    return 0;
}