Cod sursa(job #3179257)
Utilizator | mihai mihai trollolops | Data | 3 decembrie 2023 14:04:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int best_sum = INT_MIN;
int main() {
int n, sum = 0, st = 1, dr;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
if(sum + x >= 0) {
sum += x;
}
else {
sum = 0;
st = i + 1;
}
if(sum > best_sum) {
dr = i;
best_sum = sum;
}
}
cout << best_sum << ' ' << st << ' ' << dr;
return 0;
}