Cod sursa(job #2603305)
Utilizator | Mihai Cosmin bmc213 | Data | 19 aprilie 2020 10:31:53 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int n, i, x, p, pi, pf, s, smax = INT_MIN;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
cin >> n;
for(i = 1; i <= n; ++ i)
{
cin >> x;
if(s < 0)
{
s = x;
p = i;
}
else
s += x;
if(s > smax)
{
smax = s;
pi = p;
pf = i;
}
}
cout << smax << " " << pi << " " << pf;
return 0;
}