HDU 4417 Super Mario(划分树+二分)

题目链接

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 #define lson l,m,rt<<1
 #define rson m+1,r,rt<<1|1
 #define N 100100
 struct node
 {
     int l,r;
 }tree[*N];
 int sorted[N];
 int lnum[][N];
 int val[][N];
 void build(int d,int l,int r,int rt)
 {
     int m,lsame,i,lpos,rpos,same;
     tree[rt].l = l;
     tree[rt].r = r;
     if(l == r) return ;
     m = (l+r)>>;
     lsame = (m - l + );
     for(i = l;i <= r;i ++)
     {
         if(val[d][i] < sorted[m])
         lsame --;
     }
     lpos = l;
     rpos = m+;
     same = ;
     for(i = l;i <= r;i ++)
     {
         if(i == l)
         lnum[d][i] = ;
         else
         lnum[d][i] = lnum[d][i-];
         if(val[d][i] < sorted[m])
         {
             lnum[d][i] ++;
             val[d+][lpos++] = val[d][i];
         }
         else if(val[d][i] > sorted[m])
         {
             val[d+][rpos++] = val[d][i];
         }
         else
         {
             if(same < lsame)
             {
                 same ++;
                 lnum[d][i] ++;
                 val[d+][lpos++] = val[d][i];
             }
             else
             {
                 val[d+][rpos++] = val[d][i];
             }
         }
     }
     build(d+,lson);
     build(d+,rson);
 }
 int query(int d,int k,int l,int r,int rt)
 {
     int s,ss,nl,nr,m,rs,rss;
     if(l == r)
     {
         return val[d][l];
     }
     if(l == tree[rt].l)
     {
         s = lnum[d][r];
         ss = ;
     }
     else
     {
         s = lnum[d][r] - lnum[d][l-];
         ss = lnum[d][l-];
     }
     if(s >= k)
     {
         nl = ss + tree[rt].l;
         nr = ss + tree[rt].l + s - ;
         return query(d+,k,nl,nr,rt<<);
     }
     else
     {
         m = (tree[rt].l + tree[rt].r)>>;
         rss = l - tree[rt].l - ss;
         rs = r - l +  - s;
         nl = m + rss + ;
         nr = m + rs + rss;
         return query(d+,k-s,nl,nr,rt<<|);
     }
 }
 int bin(int l,int r,int key)
 {
     int str,end,mid,temp;
     str = ;end = r-l+;
     while(str < end)
     {
         mid = (str + end + )/;
         temp = query(,mid,l,r,);
         if(temp > key)
         end = mid - ;
         else
         str = mid;
     }
     return end;
 }
 int main()
 {
     int i,n,m,x,y,k,t,cas = ;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d%d",&n,&m);
         for(i = ;i <= n;i ++)
         {
             scanf("%d",&val[][i]);
             sorted[i] = val[][i];
         }
         sort(sorted+,sorted+n+);
         build(,,n,);
         printf("Case %d:\n",cas++);
         for(i = ;i < m;i ++)
         {
             scanf("%d%d%d",&x,&y,&k);
             x ++;
             y ++;
             if(k > query(,y-x+,x,y,))
             printf("%d\n",y-x+);
             else if(k < query(,,x,y,))
             printf("0\n");
             else
             printf("%d\n",bin(x,y,k));
         }
     }
     return ;
 }