Cod sursa(job #825038)
Utilizator | Data | 27 noiembrie 2012 11:49:53 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, s, p, nr, i, st, dr;
int smax=-6000001;
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;
}