Cod sursa(job #1002703)
Utilizator | Data | 28 septembrie 2013 16:26:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main ()
{
int maxSum = -2000000000, s = 0, i, p, q, r, n, x;
f >> n;
for(i = 1; i <= n; ++ i)
{
f >> x;
if(s < 0)
{
s = x;
r = i;
}
else
s += x;
if(maxSum < s)
{
maxSum = s;
p = r;
q = i;
}
}
g << maxSum << " " << p << " " << q;
f.close();
g.close();
return 0;
}