Cod sursa(job #462067)
| Utilizator | Data | 9 iunie 2010 18:14:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long s,minim=1500000,best=-1500000,N;
int i,p1,start,end;
long long nr;
int main ()
{
in>>N;
for(i=1;i<=N;i++)
{
in>>nr;
s=s+nr;
if(best<s-minim)
{
best = s-minim;
end = i;
start = p1+1;
}
if(minim>s)
{
minim=s;
p1=i;
}
}
out<<best<<' '<<start<<' '<<end;
return 0;
}
