Cod sursa(job #1433346)
Utilizator | Data | 9 mai 2015 15:17:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int v[6000000];
int main()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,i,s=0,a,b,c,d,x,smax=-1000;
f>>n;
a=1;
b=1;
for(i=1; i<=n; i++){
f>>x;
s+=x;
if(s>smax){
c=a;
smax=s;
d=i;
}
if(s<0){
s=0;
a=i+1;
}
}
g<<smax<<' '<<c<<' '<<d;
return 0;
}