Pagini recente » Cod sursa (job #1051484) | Cod sursa (job #1684095) | Cod sursa (job #591491) | Cod sursa (job #758240) | Cod sursa (job #1542640)
#include <cstdio>
using namespace std;
int main()
{
int n, i, v, start, finish=0, bestmax=0, startmax=1, finishmax=1, best1, best2;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
scanf("%d", &v);
best1=bestmax = v;
start=1;
for(i=2; i<=n; i++){
scanf("%d", &v);
if(v>best1+v){
best2=v;
start=i;
}else{
best2=best1+v;
if(v<best1+v)
finish=i;
}
if(best2>bestmax){
bestmax=best2;
startmax=start;
finishmax=finish;
}
best1=best2;
}
if(finish==0) finishmax=startmax;
printf("%d %d %d", bestmax, startmax, finishmax);
return 0;
}