Cod sursa(job #3338501)
| Utilizator | Data | 3 februarie 2026 18:26:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n;
fin >> n;
int p = 1, u = 1;
int s = 0, smax = -2000000000;
int startSecvCurenta = 1;
for (int i = 1; i <= n; i++) {
int x;
fin >> x;
if (s < 0) {
s = 0;
startSecvCurenta = i;
}
s += x;
if (smax < s) {
smax = s;
u = i;
p = startSecvCurenta;
}
}
fout << smax << " " << p << " " << u;
return 0;
}
