Cod sursa(job #1894667)
| Utilizator | Data | 27 februarie 2017 12:30:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n, dp[100100], x, rs, ans, cur, prim, first, last;
int main(){
in >> n; prim = 1;
for(int i = 1; i <= n; i++){
in >> x;
ans += x;
if(ans > rs){
rs = ans;
last = i;
}
if(ans <= 0){
ans = 0;
first = i+1;
}
}
out << rs << ' ' << first << ' ' << last;
return 0;
}
