51nod 1049 最大子段和

#include <bits/stdc++.h>using namespace std;long long a[50050];int main(){long long n,i,ans,mn;while(cin>>n){for(i=1;i<=n;i++)scanf("%lld",&a[i]);for(i=2;i<=n;i++)a[i]+=a[i-1];ans=0;mn=0;for(i=1;i<=n;i++){ans=max(ans,a[i]-mn);mn=min(mn,a[i]);}printf("%lld\n",ans);}}