Cod sursa(job #2883116)
| Utilizator | Data | 1 aprilie 2022 10:34:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| 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 main()
{
int p, q;
p = 0;
int smax = -2000000000;
int s = 0;
int smin = 2000000000;
int n;
f >> n;
int v[10000000];
for (int i = 1; i <= n; ++i)
{
f >> v[i];
s += v[i];
if (s - smin > smax)
{
smax = s - smin;
q = i;
}
if (s < smin)
{
smin = s;
p = i;
}
}
g << smax << " " << p + 1 << " " << q;
return 0;
}