Cod sursa(job #3149624)
| Utilizator | Data | 10 septembrie 2023 14:24:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
//https://www.infoarena.ro/problema/ssm
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main() {
int n, S;
in >> n;
int bestSum = -int(2e9), sum = 0, end, l=0;
for (int i = 1; i <= n; i++) {
in >> S;
if (sum < 0)
sum = S, l=0;
else
sum += S, l++;
if (bestSum < sum)
bestSum = sum, end = i;
}
out << bestSum << ' ' << end-l+1 << ' ' << end << '\n';
in.close(), out.close();
return 0;
}
