Cod sursa(job #1155627)
Utilizator | Data | 27 martie 2014 01:04:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
long long n,v[1000002],i,j,smax=0,i1=1,i2=1,s,st=1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
smax=v[1];
for(i=1;i<=n;i++)
f>>v[i];
smax=v[1];
for(i=1;i<=n;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;
}