Cod sursa(job #1858348)
| Utilizator | Data | 27 ianuarie 2017 15:03:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| 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 main()
{
int n,x,suma=0,maxim,pim,pfm,pis;
fin>>n;
fin>>x;
suma+=x;
maxim=suma;
pim=1;
pfm=1;
pis=1;
for(int i=2;i<=n;i++)
{
fin>>x;
if(x>suma+x)
{
suma=x;
pis=i;
}
else{
suma=suma+x;
}
if(suma>maxim)
{
maxim=suma;
pim=pis;
pfm=i;
}
}
fout<<maxim<<' '<<pim<<' '<<pfm;
return 0;
}
