Cod sursa(job #2422651)
Utilizator | Data | 19 mai 2019 14:21:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int n, i, x, sum, smax, pi, pf, p = 1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
for(i = 1; i <= n; i ++)
{
f >> x;
if(sum < 0)
{
sum = x;
p = i;
}
else sum += x;
if(sum > smax)
{
smax = sum;
pi = p;
pf = i;
}
}
g << smax << " " << pi << " " << pf;
f.close();
g.close();
return 0;
}