Cod sursa(job #627106)
Utilizator | Data | 29 octombrie 2011 00:03:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int a[6000010];
int main()
{
int i, i1, j1, S, N ;
fstream fin("ssm.in");
fstream fout("ssm.out");
fin>>N;
for (i=0; i<=N; i++){
fin >> a[i];
}
for (i=0; i<=N; i++){
S=S+a[i];
if (S<0){
i1=i;
S=0;
}
if (S>=0)
j1=i;
}
fout<<S<<i1<<j1;
return 0;
}