Pagini recente » Cod sursa (job #174517) | Cod sursa (job #1746757) | Cod sursa (job #109914) | Egyptian Fractions | Cod sursa (job #1520473)
#include <cstdio>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n, i, j, s, t, d, x, y, k, mi, ma, ind, maax;
mi = 0;
ma = -(1<<30);
s = ind = maax = 0;
scanf("%d",&n);
for( i = 1; i <= n; ++i ){
scanf("%d",&k);
s += k;
if( s - mi > ma ){
ma = s - mi;
y = i;
x = ind + 1;
}
if( s < mi ){
ind = i;
mi = s;
}
}
printf("%d %d %d",ma,x,y);
return 0;
}