Cod sursa(job #2571574)
| Utilizator | Data | 5 martie 2020 08:26:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
//ALEXANDRU MICLEA
#include <bits/stdc++.h>
using namespace std;
#include <fstream>
ifstream fin("ssmax.in"); ofstream fout("ssmax.out");
//VARIABLES
int n;
int ans;
int bpos, epos, pos;
int v[6000005];
//FUNCTIONS
//MAIN
int main() {
fin >> n;
for (int i = 1; i <= n; i++){
fin >> v[i];
}
for (int i = 1; i <= n; i++){
if (sum < 0){
sum = v[i];
pos = i;
}
else {
sum += v[i];
}
if (ans < sum){
ans = sum;
bpos = pos;
epos = i;
}
}
fout << ans << " " << bpos << " " << epos;
}
