Cod sursa(job #3268679)
Utilizator | Data | 16 ianuarie 2025 18:04:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
const int maxs = 6e6 + 1;
int a[maxs];
int main()
{
int x, lo, hi, Smax = -2000000001, s = -1 , start;
in >> x;
for (int i = 1; i <= x; i++){
in >> a[i];
}
for (int i = 1; i <= x; i++){
if (s < 0){
s = 0;
start = i;
}
s += a[i];
if (s > Smax){
Smax = s;
lo = start;
hi = i;
}
}
out << Smax << ' ' << lo << ' ' << hi;
return 0;
}