Cod sursa(job #302672)
Utilizator | Bacer Andrei bacerandrei | Data | 9 aprilie 2009 10:01:10 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream.h>
#define Max 7000006
int a[Max], max = -int(2e9), sc, ic, sf, pc, n, lmax;
int main()
{
int i;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i = 1; i <= n; i++)
f>>a[i];
f.close();
int idx, min = 0;
for (i = 1 ; i <= n ; i++)
{
a[i] += a[i - 1];
if (max < a[i] - min)
max = a[i] - min, ic = idx + 1, sf = i;
if (min > a[i])
min = a[i], idx = i;
}
g<<max<<" "<<ic<<" "<<sf<<"\n";
g.close();
return 0;
}