hdu3473之划分树

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#define INF 99999999
using namespace std;

const int MAX=100001;
int s[MAX],sum[20][MAX],tree[20][MAX],N;//N用来存比中位数小的数的个数
__int64 num[MAX],p[20][MAX],all;//all用来存比中位数小的所有数的和

void BuildTree(int deep,int left,int right){
	if(left == right)return;
	int mid=(left+right)>>1,ln=left,rn=mid+1,same=mid-left+1;
	for(int i=left;i<=mid;++i)if(s[i]<s[mid])--same;
	for(int i=left;i<=right;++i){
		sum[deep][i]=sum[deep][i-1];
		p[deep][i]=p[deep][i-1];//用来记录每一层比中位数小的数的所有和
		if(tree[deep][i] == s[mid]){
			if(same){
				--same;
				++sum[deep][i];
				p[deep][i]+=tree[deep][i];
				tree[deep+1][ln++]=tree[deep][i];
			}else tree[deep+1][rn++]=tree[deep][i];
		}
		else if(tree[deep][i]<s[mid]){
			++sum[deep][i];
			p[deep][i]+=tree[deep][i];
			tree[deep+1][ln++]=tree[deep][i];
		}else tree[deep+1][rn++]=tree[deep][i];
	}
	BuildTree(deep+1,left,mid);
	BuildTree(deep+1,mid+1,right);
}

int Query(int deep,int left,int right,int L,int R,int k){
	if(left == right)return tree[deep][left];
	int mid=(left+right)>>1,s,ss;
	s=sum[deep][L-1]-sum[deep][left-1];
	ss=sum[deep][R]-sum[deep][L-1];
	if(k<=ss)return Query(deep+1,left,mid,left+s,left+s+ss-1,k);
	else {N+=ss;all+=p[deep][R]-p[deep][L-1];return Query(deep+1,mid+1,right,mid+1+L-left-s,mid+1+R-left-s-ss,k-ss);}
}

int main(){
	int n,m,t,Count=1,L,R,k;
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;++i){
			scanf("%d",&s[i]);
			num[i]=num[i-1]+s[i];
			tree[0][i]=s[i];
		}
		sort(s+1,s+n+1);
		BuildTree(0,1,n);
		cin>>m;
		cout<<"Case #"<<Count++<<":\n";
		while(m--){
			scanf("%d%d",&L,&R);
			++L,++R;
			all=0,N=0;
			k=((R-L)>>1)+1;
			__int64 temp=(__int64)Query(0,1,n,L,R,k);
			N=R-L+1-N-N;
			__int64 All=num[R]-num[L-1]-all;
			printf("%I64d\n",All-N*temp-all);
		}
		cout<<endl;
	}
	return 0;
}