Cod sursa(job #1564003)
Utilizator | Data | 7 ianuarie 2016 18:53:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,i,sf,in,smax;
int v[6000001];
int main ()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
s=v[1];
in=1;
sf=1;
for(i=2;i<=n;i++)
{
s+=v[i];
if(s<0)
{
s=0;
in=i+1;
}
if(s>smax)
{
smax=s;
sf=i;
}
}
fout<<smax<<" "<<in<<" "<<sf;
return 0;
}