Pagini recente » Cod sursa (job #2601183) | Cod sursa (job #2815629) | Cod sursa (job #1721560) | Cod sursa (job #290816) | Cod sursa (job #2843388)
#include <bits/stdc++.h>
using namespace std;
int v[6000005];
int s[6000005];
int best[6000005];
int main(){
ifstream cin("ssm.in");
ofstream cout("ssm.out");
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for(int i=1; i<=n; i++){
cin >> v[i];
s[i] = s[i-1] + v[i];
}
int di, dj;
int minim = s[0];
int actual = 1;
int bestsum = INT_MIN;
for(int i=1; i<=n; i++){
best[i] = s[i] - minim;
if(minim>s[i]){
minim = s[i];
actual = i + 1;
}
if(bestsum < best[i]){
bestsum = best[i];
dj = i;
di = actual;
}
}
cout << bestsum << ' ' << di << ' ' << dj;
return 0;
}