Cod sursa(job #1155632)
Utilizator | Data | 27 martie 2014 01:12:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
long long n,v[6000002],i,smax,i1=1,i2=1,s,st=1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;f>>v[1];smax=v[1];s=v[1];
for(i=2;i<=n;i++)
{f>>v[i];
if(s<0)
{s=0;st=i;}
s+=v[i];
if(s>smax)
{
smax=s;
i1=st;i2=i;
}
}
g<<smax<<' '<<i1<<' '<<i2;
f.close();g.close();
return 0;
}