Cod sursa(job #2699908)
| Utilizator | Data | 26 ianuarie 2021 10:19:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#define int long long
using namespace std;
int32_t main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n;
cin >> n;
int v[60001];
for (int i = 1; i <= n; ++i)
cin >> v[i];
int st, dr, smax = -2000000000, s = -1, start;
for (int i = 1; i <= n; ++i)
{
if (s < 0)
s = 0, start = i;
s += v[i];
if (s > smax)
smax = s, st = start, dr = i;
}
cout << smax << " " << st << " " << dr;
return 0;
}
