Pagini recente » Cod sursa (job #2289867) | Cod sursa (job #2029839) | Cod sursa (job #1365184) | Cod sursa (job #716533) | Cod sursa (job #800843)
Cod sursa(job #800843)
#include<fstream>
#define NMAX 6000010
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[NMAX],sum[NMAX],best[NMAX],bestSum,i,k,start,end;
int main()
{f>>n;
sum[0]=0; int min=sum[0];
for( i=1; i<=n; ++i) f>>a[i];
for( i=1; i<=n; ++i)
sum[i]=a[i]+sum[i-1];
bestSum=1<<31;
for( i=1; i<=n; ++i)
{
best[i]=sum[i]-min;
if(min > sum[i]) {min=sum[i]; k=i;}
if(bestSum < best[i])
{bestSum=best[i]; start=k; end=i;}
}
g<<bestSum<<" "<<start<<" "<<end<<" ";
return 0;
}