Pagini recente » Cod sursa (job #1554172) | Cod sursa (job #3162663) | Cod sursa (job #1933889) | Cod sursa (job #1759730) | Cod sursa (job #341215)
Cod sursa(job #341215)
#include <stdio.h>
#define N 250005
long long n,m,v[N];
long long sum[N],sum2[N],sum3[N];
long long x,y,numar;
void precalculate()
{
long long i;
for (i=1; i<=n; i++)
{
scanf("%lld",&v[i]);
sum[i]=sum[i-1]+v[i];
sum2[i]=sum2[i-1]+sum[i-1];
}
for (i=n; i>=1;i--)
sum3[i]=sum3[i+1]+sum[n]-sum[i];
}
long long cbin()
{
long long st=x,dr=y,t;
while (st!=dr)
{
t=(st+dr)/2;
if (numar<=sum[t]-sum[x-1])
dr=t;
else
st=t+1;
}
if (sum[st]-sum[x-1]<numar)
++st;
return st;
}
int main()
{
freopen("cuburi2.in","r",stdin);
freopen("cuburi2.out","w",stdout);
scanf("%lld%lld",&n,&m);
precalculate();
long long i,t,rez;
for (i=1; i<=m; i++)
{
scanf("%lld%lld",&x,&y);
numar=(sum[y]-sum[x-1])/2;
t=cbin();
rez=sum2[t]-sum2[x]-sum[x-1]*(t-x);
rez+=sum3[t]-sum3[y]-(sum[n]-sum[y])*(y-t);
printf("%lld ",t);
printf("%lld\n",rez);
}
return 0;
}