Cod sursa(job #3339320)
| Utilizator | Data | 7 februarie 2026 14:16:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main() {
int n;
in >> n;
int x;
in >> x;
int s = x;
int smax = x;
int ist = 1, maxst = 1, maxfin = 1;
for (int i = 2; i <= n; i++) {
in >> x;
if (x > s + x) {
s = x;
ist = i;
} else {
s += x;
}
if (s > smax) {
smax = s;
maxst = ist;
maxfin = i;
}
}
cout << smax << " " << maxst << " " << maxfin;
return 0;
}