hdu 3473 Minimum Sum

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3473

题目大意:求数列X0,X1,...,Xn-1中任意区间[l,r]中min{求和(|N-Xi|)}(N为区间[L,R]的某一数,L<=i<=R).

题目思路:
容易证明选择的N是该区间的中位数,笔者可以自己试着证明.
既然记得求中位数,加上那么大的数据量,不难想到划分树.
比模板划分树多了一个sum[][i],表示某节点上从左端点到i的数值和.
这样就可以在递归求解中位数时求和,最后要记得判断区间奇偶性.
因为偶长度区间的求得的值还需要减去一个中位数,这个容易证明的.

ps:递归求和时,要防止减数越界(不明白的话,wa了后仔细想应该会明白...).

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll __int64
//#define ll long long
#define son1 New(p.xl,xm,p.yl,ym),(rt<<2)-2
#define son2 New(p.xl,xm,min(ym+1,p.yr),p.yr),(rt<<2)-1
#define son3 New(min(xm+1,p.xr),p.xr,p.yl,ym),rt<<2
#define son4 New(min(xm+1,p.xr),p.xr,min(ym+1,p.yr),p.yr),rt<<2|1
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define middle l+r>>1
#define INF 0x3F3F3F3F
#define esp (1e-8)
#define MOD 100000007
#define type int
//const double pi=acos(-1.0);
const int M=100005;
ll min(ll x,ll y){return x<y? x:y;}
ll max(ll x,ll y){return x>y? x:y;}
void swap(ll& x,ll& y){ll t=x;x=y;y=t;}
int T,cas=0;

int n,m;
int socured[M],tol[20][M],val[20][M];
ll sum[20][M];

void build(int l,int r,int cur){
	if(l==r){sum[cur][l]=val[cur][l];return;}
	int i,mid=middle,lsame=mid-l+1;
	for(i=l;i<=r;i++){
		if(val[cur][i]<socured[mid]) lsame--;
		sum[cur][i]=val[cur][i];
		if(i>l) sum[cur][i]+=sum[cur][i-1];
	}
	int lpos=l,rpos=mid+1,same=0;
	for(i=l;i<=r;i++){
		tol[cur][i]= l==i? 0:tol[cur][i-1];
		if(val[cur][i]<socured[mid])
			tol[cur][i]++,val[cur+1][lpos++]=val[cur][i];
		else if(val[cur][i]>socured[mid])
			val[cur+1][rpos++]=val[cur][i];
		else{
			if(same<lsame){
				same++,tol[cur][i]++;
				val[cur+1][lpos++]=val[cur][i];
			}else val[cur+1][rpos++]=val[cur][i];
		}
	}
	build(l,mid,cur+1),build(mid+1,r,cur+1);
}

ll query(int l,int r,int cur,int L,int R,int k,ll &ret){
	if(L==R) return val[cur][L];
	int x,xx;
	if(L==l) x=tol[cur][R],xx=0;
	else x=tol[cur][R]-(xx=tol[cur][L-1]);
	int mid=middle,newL,newR;
	int y=R-L+1-x,yy=L-l-xx,tmpL,tmpR;
	if(x>=k){
		newL=l+xx,newR=newL+x-1;
		tmpL=mid+yy+1,tmpR=tmpL+y-1;
		if(y>0) ret+=sum[cur+1][tmpR]-(yy? sum[cur+1][tmpL-1]:0);
		return query(l,mid,cur+1,newL,newR,k,ret);
	}else{
		newL=mid+yy+1,newR=newL+y-1;
		tmpL=l+xx,tmpR=tmpL+x-1;
		if(x>0) ret-=sum[cur+1][tmpR]-(xx? sum[cur+1][tmpL-1]:0);
		return query(mid+1,r,cur+1,newL,newR,k-x,ret);
	}
}

void run(){
	scanf("%d",&n);
	memset(sum,0,sizeof(sum));
	for(int i=1;i<=n;i++){
		scanf("%d",&val[0][i]);
		socured[i]=val[0][i];
	}
	sort(socured+1,socured+n+1);
	build(1,n,0);
	scanf("%d",&m);
	int l,r; 
	printf("Case #%d:\n",cas);
	while(m--){
		scanf("%d%d",&l,&r);
		l++,r++;
		int len=r-l+1;
		ll ret=0,k_num=query(1,n,0,l,r,len+1>>1,ret);
		if(!(len&1)) ret-=k_num;
		printf("%I64d\n",ret);
	}puts("");
}

int main(){
	//freopen("1.in","r",stdin);
	//freopen("me.out","w",stdout);
	//run();
	for(scanf("%d",&T),cas=1;cas<=T;cas++) run();
	//while(~scanf("%d",&n)) run();
	return 0;
}