Cod sursa(job #1433413)
Utilizator | Data | 9 mai 2015 15:21:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,v[6000001],smax=-1000000000000,s=0,m=0,starts=0,start=0,end;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=0;i<n;i++){
f>>v[i];
s=s+v[i];
if(s>smax){
start=starts;
end=i;
smax=s;
}
if(s<0){
s=0;
starts=i+1;
}
}
g<<smax<<' '<<start+1<<' '<<end+1;
return 0;
}