Cod sursa(job #3339231)
| Utilizator | Data | 7 februarie 2026 10:32:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX = 6e6;
int v[NMAX];
int n, st, dr, maxi = INT_MIN, s = -1, start;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
for (int i = 1; i <= n; i++) {
if (s < 0) {
s = 0;
start = i;
}
s += v[i];
if (s > maxi) {
maxi = s;
st = start;
dr = i;
}
}
cout << maxi << " " << st << " " << dr;
return
}