Cod sursa(job #824993)
Utilizator | Data | 27 noiembrie 2012 11:35: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, nr,s1,d,m,S,mmax=-1000000000;
int main(){
f>>n;
for(i=1;i<=n;++i){
f>>nr;
if(S<0){
S=0;
m=i;
}
S=S+nr;
if(S>mmax)
{ s1=m;
d=i;
mmax=S;
}
}
g<<mmax<<' '<<s1<<' '<<d<<'\n';
g.close();
return 0;
}