Cod sursa(job #824575)
Utilizator | Data | 26 noiembrie 2012 19:18:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
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 n,i,st, dr, nr,k,s, maxi=-600000;
int main(){
f>>n;
for(i=1;i<=n; ++i){
f>>nr;
if(s<0){s=0; k=i;}
s=s+nr;
if(s>maxi){
st=k;
dr=i;
maxi=s;
}
}
g<<maxi<<' '<<st<<' '<<dr<<'\n';
g.close();
return 0;
}