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