Cod sursa(job #3268915)
Utilizator | Data | 18 ianuarie 2025 03:18:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long int n;
int v[6000000];
int main() {
fin >> n;
int s=0, cnt = 1, cnt_final, f, max = -9999999;
for(int i=1;i<=n;++i) {
if(s < 0) {
s = 0;
cnt = i;
}
fin >> v[i];
s += v[i];
if(s > max) {
max = s;
cnt_final = cnt;
f = i;
}
}
fout << max << ' ' << cnt_final << ' ' << f;
return 0;
}