Cod sursa(job #474181)
Utilizator | Data | 2 august 2010 18:17:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int S[6000001];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n;
in>>n;
for(int i=1;i<=n;i++) in>>S[i];
int best=-int(2e9),min,idx=0,bgn,end;
for(int i=2;i<=n;i++)
{
S[i]+=S[i-1];
if(best<S[i]-min)
best=S[i]-min,bgn=idx+1,end=i;
if(min>S[i])
min=S[i],idx=i;
}
out<<best<<" "<<bgn<<" "<<end;
return 0;
}