Pagini recente » Istoria paginii runda/preonii20051 | Cod sursa (job #2006248) | Cod sursa (job #781325) | Cod sursa (job #2324129) | Cod sursa (job #1879920)
#include<bits/stdc++.h>
#define N 6000020
using namespace std;
int n, a[N], i, dp[N], s=-20000000, bg, b=1, e;
int main(){
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d", &a[i]);
dp[i]=a[i];
}
dp[0]=0;
for(i=1;i<=n;i++){
if(dp[i]<dp[i-1]+a[i]) dp[i]=dp[i-1]+a[i];else b=i;
if(dp[i]>s){
s=dp[i];
bg=b;
e=i;
}
}
printf("%d ", s);
printf("%d %d", bg, e);
return 0;
}