Cod sursa(job #820883)
Utilizator | Data | 21 noiembrie 2012 12:22:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int a,b,c,n,v[6000000],sc=0,max=-2000000000,i;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n; i++)
{
if(sc<0)
{sc=0;
a=i;
}
sc=sc+v[i];
if (sc>max)
{max=sc;
b=a;
c=i;
}
}
g<<max<<" "<<b<<" "<<c;
}