Cod sursa(job #824954)
Utilizator | Data | 27 noiembrie 2012 11:20:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i, m, a ,y ,p ,b, x, maximm=-600000;
int main(){
f>>m;
for(i=1;i<=m; ++i){
f>>x;
if(p<0){p=0; y=i;}
p+=x;
if(p>maximm)
{b=i;
maximm=p;
a=y;
}
}
g<<maximm<<' '<<a<<' '<<b;
g<<'\n';
g.close();
return 0;
}