Cod sursa(job #640668)
Utilizator | Data | 26 noiembrie 2011 11:53:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,e1,e2;
fin>>n;
int i;
fin>>e1;
int smax=e1,iinc=1,i2=1, svechi = e1,ifin=1,iincmax=1;
for (i=2;i<=n;i++)
{
fin>>e2;
if(svechi+e2 >= e2)
svechi += e2;
else svechi = e2, iinc = i;
if (svechi>smax)
{
smax=svechi;
iincmax=iinc;
ifin = i;
}
e1=e2;
}
fout<<smax<<" "<<iincmax<<" "<<ifin;
return 0;
}