Pagini recente » Cod sursa (job #1490163) | Cod sursa (job #685370) | Cod sursa (job #2444052) | Cod sursa (job #1159937) | Cod sursa (job #1560341)
#include <iostream>
#include <cstdio>
using namespace std;
int n,x,s[100010],mx,mi1,mi2;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
mx=1;
mi1=mi2=0;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
scanf("%d",&x);
s[i]+=s[i-1]+x;
if(s[i]>s[mx])
{
mx=i;
if(s[mi2]<s[mi1])
mi1=mi2;
}
else if(s[i]<s[mi1] && i<mx)
mi1=i;
else if(s[i]<s[mi2] && i>mx)
mi2=i;
}
printf("%d %d %d",(s[mx]-s[mi1]),mi1+1,mx);
return 0;
}