Cod sursa(job #824957)
Utilizator | Data | 27 noiembrie 2012 11:21:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, m, l, r, mij, maxim=-6000000, s, i;
int main(){
f>>n;
for(i=1; i<=n; ++i){
f>>m;
if(s<0){
s=0;
mij=i;
}
s=s+m;
if(s>maxim){
l=mij;
r=i;
maxim=s;
}
}
g<<maxim<<' '<<l<<' '<<r<<'\n';
g.close();
return 0;
}