Cod sursa(job #824566)
Utilizator | Data | 26 noiembrie 2012 19:11:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i, n, p, s, st, dr, nr;
int smax =-7000000;
int main()
{f>>n;
for(i=1;i<=n;++i){
f>>nr;
if(s<0){
s=0; p=i;}
else s=s+nr;
if (s>smax){
st=p;
dr=i;
smax=s;}
}
g<<smax<<' '<<st<<' '<<dr;
g.close();
return 0;
}