Cod sursa(job #2989212)
| Utilizator | Data | 6 martie 2023 10:46:43 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000005];
int main() {
fin >> n;
for(int i = 1; i <= n; i++) {
fin >> v[i];
}
int maxim = INT_MIN, st = 1, dr = 0, sc = 0;
for(int i = 1; i <= n; i++) {
sc += v[i];
if(sc < 0) {
sc = 0;
st = i + 1;
}
if(sc > maxim) {
maxim = sc;
dr = i;
}
}
fout << maxim << " " << st << " " << dr;
return 0;
}
