Pagini recente » Cod sursa (job #1565092) | Cod sursa (job #1025925) | Cod sursa (job #862379) | Cod sursa (job #1335170) | Cod sursa (job #239438)
Cod sursa(job #239438)
#include<stdio.h>
long int b[50000],i1,k,i,min,max,sum,ant,m;
int a[50000],n;
void gen()
{b[1]=a[1];
// for(i=2;i<=n;i++)
// b[i]=a[i]+b[i-1];
min=b[1];k=i1=1;
max=b[1];
for(i=1;i<=n;i++)
{if(min>b[i])
{ min=b[i];
k=i;
}
if(max<b[i])
{ max=b[i];
i1=i;
}
}}
void read()
{ scanf("%d",&a[1]);
b[1]=a[1];
for(i=2;i<=n;i++)
{ scanf("%d",&a[i]);
b[i]=b[i-1]+a[i];
}
}
int main ()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&m);
read();
gen();
sum=a[k+1];
printf("%d %d %d\n",k+1,i1,b[i1]-b[k]);
// for(i=1;i<=n;i++)
// {
// printf("%d ",b[i]);
//}
return 0;
}