Cod sursa(job #1517540)
Utilizator | Data | 4 noiembrie 2015 16:04:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
int n, x, maxim, i, s, pmax, umax, p;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
maxim = -2000000000;
p = 1;
for (i=1;i<=n;i++)
{
f>>x;
if (x + s >= x)
{
s = x + s;
}
else {
s = x;
p = i;
}
if (s > maxim)
{
maxim = s;
pmax = p;
umax = i;
}
}
f.close();
g<<maxim<<" "<<pmax<<" "<<umax;
g.close();
return 0;
}