Cod sursa(job #825019)
| Utilizator | Data | 27 noiembrie 2012 11:44:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,sum,i,str,fin,nr,r,maxx=-6000001,v[6000001];
int main ()
{f>>n; str=fin=1;
for (i=1;i<=n;++i){
f>>v[i];
if (sum<0){
sum=v[i];
r=i;
str=i;
}
else
sum+=v[i];
if (n<sum){
n=sum;
fin=i;
maxx=sum;
}
}
g<<maxx<<' ';
g<<str<<' ';
g<<fin;
g.close();
return 0;
}
