Cod sursa(job #1474139)
| Utilizator | Data | 21 august 2015 00:49:10 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n;
cin >> n;
int m = 2147483649, s = 0, j, in = 1, sf, IN, SF;
for(int i = 1; i <= n; i ++){
cin >> j;
if( j > 0 ){
if( s > 0){
s += j;
sf = i;
}
else{
s = j;
in = i;
sf = i;
}
}
else{
s += j;
sf = i;
}
if( m < s){
m = s;
IN = in;
SF = sf;
}
}
cout << m << " " << IN << " " << SF << "\n";
return 0;
}
