Cod sursa(job #3275068)
Utilizator | Data | 9 februarie 2025 10:27:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, x, s = 0, st = 0, dr = 0, smax = INT_MIN;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x > s + x)
st = i;
s = max(x, s + x);
if (s > smax) {
smax = s;
dr = i;
}
}
cout << smax << ' ' << ++st << ' ' << ++dr;
return 0;
}