Cod sursa(job #903111)
| Utilizator | Data | 1 martie 2013 18:34:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long v[6000001],ma,mi,x,i,n,fin,inc,m;
int main ()
{
mi=999999999;
ma=-999999999;
f>>n;
for(i=1;i<=n;++i)
{
f>>x;
v[i]=v[i-1]+x;
if(v[i]-mi>ma)
{
ma=v[i]-mi;
fin=i;
inc=m;
}
if(v[i]<mi)
{
mi=v[i];
m=i;
}
}
g<<ma<<" "<<inc+1<<" "<<fin;
return 0;
}