Cod sursa(job #1854768)
| Utilizator | Data | 23 ianuarie 2017 11:19:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i, s, pi, smax, pimax, pfmax,x;
fin>>n;
fin>>x;
s=x; pi=1;
smax=x; pimax=1; pfmax=1;
for (i=2;i<=n;i++)
{
fin>>x;
if (s+x>x || s+x==x && pi==i-1)
{
s=s+x;
} else {
s=x;
pi=i;
}
if (s>smax) {
smax=s;
pimax=pi;
pfmax=i;
}
}
fout<<smax<<" "<<pimax<<" "<<pfmax;
return 0;
}
