Cod sursa(job #393656)
| Utilizator | Data | 9 februarie 2010 19:42:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream.h>
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long max,a[6000001];
long n,i,j,pi,pf;
int main()
{
fin>>n;
fin>>a[1];
for (i=2;i<=n;i++)
{fin>>a[i];
a[i]+=a[i-1];
}
max=a[1];
for (i=2;i<=n;i++)
for (j=1;j<i;j++)
if (a[i]-a[j]>max) {max=a[i]-a[j]; pi=j; pf=i;}
fout<<max<<' '<<pi+1<<' '<<pf;
fout.close();
return 0;
}
