Cod sursa(job #2120235)
| Utilizator | Data | 2 februarie 2018 10:22:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
/*
ID : thoria1991
TASK : barn1
LANG : C++11
*/
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a, best = -(int)(2e9), st, sf;
int main(){
fin >> n;
int sum = 0, first = 1;
for(int i = 1; i <= n; i ++){
fin >> a;
if(sum < 0) sum = 0, first = i;
sum += a;
if(sum > best)
st = first, sf = i, best = sum;
}
fout << best << ' ' << st << ' ' << sf;
}
