Cod sursa(job #2702131)
Utilizator | Popa Sebastian beingsebi | Data | 2 februarie 2021 22:44:18 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, s, maxim, p1, p2, ap;
int main()
{
f >> n >> s;
maxim = s;
p1 = p2 = ap = 1;
for (int i = 2, x; i <= n; i++)
{
f >> x;
s += x;
if (s < 0)
s = 0, ap = i + 1;
if (s > maxim)
maxim = s, p1 = ap, p2 = i;
}
g << maxim << " " << p1 << " " << p2;
return 0;
}