Cod sursa(job #462074)
| Utilizator | Data | 9 iunie 2010 18:20:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long s,min=1500000,maxim=-1500000,n;
int i,p1,st,dr;
long long nr;
int main ()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>nr;
s=s+nr;
if(maxim<s-min)
{
maxim=s-min;
dr=i;
st=p1+1;
}
if(minim>s)
{
min=s;
p1=i;
}
}
g<<maxim<<' '<<st<<' '<<dr;
return 0;
}
