Cod sursa(job #2381573)
Utilizator | bcosmin bcosmin | Data | 17 martie 2019 08:23:00 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n, s, maxx = INT_MIN, pi, pf, x, i, p;
int main()
{
f >> n;
for(i = 1; i <= n; i ++)
{
f >> x;
if(s < 0)
{
s = x;
p = i;
}
else s = s + x;
if(s > maxx)
{
maxx = s;
pi = p;
pf = i;
}
}
g << maxx << " " << pi << " " << pf;
f.close();
g.close();
return 0;
}