Cod sursa(job #670492)
#include <fstream>
using namespace std ;
int main ()
{
int a[6000005],n,i,j,bestSum,min,INFINIT,sum[6000003],best [6000004];
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
sum[0] = 0;
for (i = 1; i <= n; i++)
{
sum[i] = a[i] + sum[i-1];
min = sum[0];
bestSum = -INFINIT; }
for (i = 1; i <= n; i++)
{
best[i] = sum[i] - min;
if (min > sum[i]) min = sum[i];
if (bestSum < best[i])
bestSum = best[i];
}
cout<<best[i];
cin.close();
cout.close();
return 0;
}