Cod sursa(job #3214864)
Utilizator | Data | 14 martie 2024 15:16:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, a, s, ma = INT_MAX, p, p1, p2;
int main() {
fin >> n;
s = -1;
for(i = 1; i <= n; i++) {
fin >> a;
if(s < 0) {
s = 0;
p = i;
}
s += a;
if(ma < s) {
ma = s;
p1 = p;
p2 = i;
}
}
fout << ma << " " << p1 << " " << p2;
return 0;
}