Cod sursa(job #3347105)
| Utilizator | Data | 15 martie 2026 16:40:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long sm = -2000000000, s = 0;
int st, dr, p = 1,i;
int main() {
int n, x;
f >> n;
for ( i = 1; i <= n; i++) {
f >> x;
if (s < 0) {
s = x;
p = i;
} else {
s += x;
}
if (s > sm) {
sm = s;
st = p;
dr = i;
}
}
g << sm << " " << st << " " << dr << endl;
return 0;
}
