Cod sursa(job #1644585)
| Utilizator | Data | 10 martie 2016 00:28:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x, s, n, pi, pp, Max = -10000000, fi, ff;
int main()
{
f>>n;
for(int i = 1; i <= n; i++)
{
f>>x;
if(s >= 0)
{
s += x;
pp= i;
}
else
{
s = x;
pp = pi = i;
}
if(s > Max)
{
Max = s;
fi = pi;
ff = pp;
}
}
g<<Max<<' '<<fi<<' '<<ff<<'\n';
return 0;
}
