HDU - 3473 Minimum Sum（划分树模板）

Minimum Sum

 

Problem Description

You are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a number x to make as small as possible! 

Input 

The first line is an integer T (T <= 10), indicating the number of test cases. For each test case, an integer N (1 <= N <= 100,000) comes first. Then comes N positive integers x (1 <= x <= 1,000, 000,000) in the next line. Finally, comes an integer Q (1 <= Q <= 100,000), indicting there are Q queries. Each query consists of two integers l, r (0 <= l <= r < N), meaning the interval you should deal with.

 Output 

For the k-th test case, first output “Case #k:” in a separate line. Then output Q lines, each line is the minimum value of . Output a blank line after every test case.

Sample Input 

2

5

3 6 2 2 4 

2

1 4

0 2

2

7 7 

2 

0 1 

1 1

Sample Output

Case #1: 

6 

4 

Case #2: 

0 

0 

题意：询问区间所有数与中位数的差的绝对值

解题思路：划分树模板，学了一下划分树。划分树在于能求区间第K大，然后他的性质又很好的符合这道题！

看着这张图，就能理解划分树原理了。

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<memory.h>
using namespace std;
const int MAXN=100010;

int A[MAXN];
int Sorted[MAXN];
int num[20][MAXN];//i前面有多少个点进入左孩子
long long int sum[20][MAXN];//i前面的和
int Val[20][MAXN];//每层的数组，0层就是原数组

void build(int l,int r,int ceng){
    if(l==r){
        sum[ceng][l]=sum[ceng][l-1]+Val[ceng][l];
        return;
    }
    
    int mid=(l+r)>>1;
    int same=mid-l+1;//保存有多少和中位数一样大的数进入左孩子
    
    for(int i=l;i<=r;i++){
        if(Val[ceng][i]<Sorted[mid])
            same--;
        sum[ceng][i]+=sum[ceng][i-1]+Val[ceng][i];
    }
    
    int ln=l;
    int rn=mid+1;//左右孩子的开头区间下标
    
    for(int i=l;i<=r;i++){
        if(Val[ceng][i]<Sorted[mid]){
            Val[ceng+1][ln++]=Val[ceng][i];
        }
        else{
            if((Val[ceng][i]==Sorted[mid]&&same>0)){
                Val[ceng+1][ln++]=Val[ceng][i];
                same--;
            }
            else
                Val[ceng+1][rn++]=Val[ceng][i];
        }
        num[ceng][i]=num[ceng][l-1]+ln-l;
    }
    build(l,mid,ceng+1);
    build(mid+1,r,ceng+1);
    
}

long long int ans=0;
int query(int L,int R,int K,int l,int r,int ceng){
    if(L==R)
        return Val[ceng][L];
    
    
    int mid=(l+r)>>1;
    int tl=num[ceng][R]-num[ceng][L-1];
    
    if(tl>=K){
        
        int ee=R-l+1 - (num[ceng][R]-num[ceng][l-1]) +mid;
        int ss=L-l+1 - (num[ceng][L-1]-num[ceng][l-1]) +mid;
        
        ans+=sum[ceng+1][ee]-sum[ceng+1][ss-1];
        
        
        int newl=l+num[ceng][L-1]-num[ceng][l-1];
        int newr=newl+tl-1;
        return query(newl,newr,K,l,mid,ceng+1);
    }
    else{
        
        int ss = l+ num[ceng][L-1]-num[ceng][l-1];
        int ee = ss +tl-1;
        
        ans-=sum[ceng+1][ee]-sum[ceng+1][ss-1];
        
        
        int newr=R+num[ceng][r]-num[ceng][R];
        int newl=newr-(R-L-tl);
        return query(newl,newr,K-tl,mid+1,r,ceng+1);
    }
    
}


int main(){
    
    int n,m,l,r;
    int t;
    scanf("%d",&t);
    
    for(int qqq=1;qqq<=t;qqq++)
    {
        memset(sum,0,sizeof(sum));
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&Val[0][i]);
            Sorted[i]=Val[0][i];
        }
        sort(Sorted+1,Sorted+n+1);
        build(1,n,0);
        scanf("%d",&m);
        printf("Case #%d:\n",qqq);
        while(m--)
        {
            ans=0;
            scanf("%d%d",&l,&r);
            l++;r++;
            int temp=query(l,r,(l+r)/2-l+1,1,n,0);
            if((l+r)%2)ans-=temp;
            printf("%I64d\n",ans);
        }
        printf("\n");
    }
    
    return 0;
}