Cod sursa(job #1262615)
| Utilizator | Data | 13 noiembrie 2014 13:01:16 | |
|---|---|---|---|
| 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;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int pmi,pmf,pf,pi,smax,s,i,n,x;
int main()
{
fin >>n>>x;
pmi=1;
pmf=1;
pi=1;
pf=1;
s=x;
smax=x;
for(i=2;i<=n;i++)
{
fin>>x;
if(x<s+x)
{
s=s+x;
pf=i;
}
else
{
s=x;
pi=pf=i;
}
if(s>smax)
{
smax=s;
pmi=pi;
pmf=pf;
}
}
fout <<smax<<" "<<pmi<<" "<<pmf;
return 0;
}
