Minimum Sum - HDU 3473 划分树

Minimum Sum

Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3275    Accepted Submission(s): 754

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
  
  

 

题意：找到区间的中间值，求区间所有数和这个数的差的绝对值的和。

思路：划分树，参考http://blog.csdn.net/shiqi_614/article/details/8041390

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int T,t,n,m,sorted[100010],val[20][100010],toleft[20][100010];
int lnum,rnum;
ll sum[20][100010],lsum,rsum;
void build(int l,int r,int d)
{
    if(l==r)
      return;
    int i,j,mid=(l+r)/2,same=mid-l+1,lp=l,rp=mid+1;
    for(i=l;i<=r;i++)
       if(val[d][i]<sorted[mid])
         same--;
    for(i=l;i<=r;i++)
    {
        if(i==l)
        {
            toleft[d][i]=0;
            sum[d][i]=0;
        }
        else
        {
            toleft[d][i]=toleft[d][i-1];
            sum[d][i]=sum[d][i-1];
        }
        if(val[d][i]<sorted[mid])
        {
            toleft[d][i]++;
            sum[d][i]+=val[d][i];
            val[d+1][lp++]=val[d][i];
        }
        else if(val[d][i]>sorted[mid])
          val[d+1][rp++]=val[d][i];
        else
        {
            if(same)
            {
                same--;
                toleft[d][i]++;
                sum[d][i]+=val[d][i];
                val[d+1][lp++]=val[d][i];
            }
            else
              val[d+1][rp++]=val[d][i];
        }
    }
    build(l,mid,d+1);
    build(mid+1,r,d+1);
}
int query(int a,int b,int k,int l,int r,int d)
{
    if(a==b)
      return val[d][a];
    int s,ss,mid=(l+r)/2;
    ll sss;
    if(a==l)
    {
        s=toleft[d][b];
        ss=0;
        sss=sum[d][b];
    }
    else
    {
        s=toleft[d][b]-toleft[d][a-1];
        ss=toleft[d][a-1];
        sss=sum[d][b]-sum[d][a-1];
    }
    if(s>=k)
    {
        a=l+ss;
        b=l+ss+s-1;
        return query(a,b,k,l,mid,d+1);
    }
    else
    {
        lnum+=s;
        lsum+=sss;
        a=mid+1+a-l-ss;
        b=mid+1+b-l-toleft[d][b];
        return query(a,b,k-s,mid+1,r,d+1);
    }
}
int main()
{
    int i,j,k,a,b;
    ll s[100010],avg,ans;
    scanf("%d",&T);
    for(t=1;t<=T;t++)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&sorted[i]);
            val[0][i]=sorted[i];
            s[i]=s[i-1]+sorted[i];
        }
        sort(sorted+1,sorted+1+n);
        build(1,n,0);
        printf("Case #%d:\n",t);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d",&a,&b);
            a++;b++;
            k=(b-a+2)/2;
            lsum=lnum=0;
            avg=query(a,b,k,1,n,0);
            rnum=b-a+1-lnum;
            rsum=s[b]-s[a-1]-lsum;
            ans=rsum-rnum*avg+lnum*avg-lsum;
            printf("%I64d\n",ans);
        }
        printf("\n");
    }
}