hdu4417:super mario

 

1. #include <iostream> 
2. #include<algorithm> 
3. #include<cstdio> 
4. using namespace std; 
5. #define M 100005 
6. int tree[40][M]; 
7. int toLeft[40][M]; 
8. int sorted[M]; 
9. int n,m; 
10. void build(int level,int ll,int rr){ 
11.     if(ll==rr)return; 
12.     int mid=(ll+rr)>>1; 
13.     int i,suppose; 
14.     suppose=mid-ll+1; 
15.     for(i=ll;i<=rr;i++){ 
16.         if(tree[level][i]<sorted[mid]){ 
17.             suppose--; 
18.         } 
19.     } 
20.  
21.     int lpos=ll,rpos=mid+1; 
22.     for(i=ll;i<=rr;i++){ 
23.         if(i==ll){ 
24.             toLeft[level][i]=0; 
25.         }else{ 
26.             toLeft[level][i]=toLeft[level][i-1]; 
27.         } 
28.         if(tree[level][i]<sorted[mid]){ 
29.             toLeft[level][i]++; 
30.             tree[level+1][lpos++]=tree[level][i]; 
31.         }else if(tree[level][i]>sorted[mid]){ 
32.             tree[level+1][rpos++]=tree[level][i]; 
33.         }else{ 
34.             if(suppose!=0){ 
35.                 suppose--; 
36.                 toLeft[level][i]++; 
37.                 tree[level+1][lpos++]=tree[level][i]; 
38.             }else{ 
39.                 tree[level+1][rpos++]=tree[level][i]; 
40.             } 
41.         } 
42.     } 
43.     build(level+1,ll,mid); 
44.     build(level+1,mid+1,rr); 
45. } 
46. //在[left,right]数据中查询[qleft,qright]中第k大的数据 
47. int query(int level,int left,int right,int qleft,int qright,int k){ 
48.     if( qleft==qright) 
49.         return tree[level][qleft]; 
50.     int s;//代表[left,qleft)之间有多个个元素被分到左边 
51.     int ss;//[qleft, qright]内将被划分到左子树的元素数目 
52.     int mid=(left+right)>>1; 
53.     if(left==qleft){ 
54.         s=0; 
55.         ss=toLeft[level][qright]; 
56.     }else{ 
57.         s=toLeft[level][qleft-1]; 
58.         ss=toLeft[level][qright]-s; 
59.     } 
60.     int newl,newr; 
61.     if(k<=ss){//查询左边 
62.         newl=left+s; 
63.         newr=left+s+ss-1; 
64.         return query(level+1,left,mid,newl,newr,k); 
65.     }else{//查询右边 
66.         newl=mid-left+1+qleft-s; 
67.         newr=mid-left+1+qright-s-ss; 
68.         return query(level+1,mid+1,right,newl, newr,k - ss); 
69.     } 
70. } 
71. int solve(int ll,int rr,int h){ 
72.     int l=1,r=(rr-ll)+1; 
73.     int mid; 
74.     int ans=0; 
75.     while(l<=r){ 
76.         mid=(l+r)>>1; 
77.         int tmp=query(0,1,n,ll,rr,mid); 
78.         if(tmp<=h){ 
79.             ans=mid; 
80.             l=mid+1; 
81.         }else{ 
82.             r=mid-1; 
83.         } 
84.     } 
85.     return ans; 
86. } 
87. int main(){ 
88.     int t,ti=1; 
89.     int i; 
90.     scanf("%d",&t); 
91.     while(t--){ 
92.         scanf("%d %d",&n,&m); 
93.         for(i=1;i<=n;i++){ 
94.             scanf("%d",&tree[0][i]); 
95.             sorted[i]=tree[0][i]; 
96.         } 
97.         sort(sorted+1,sorted+n+1); 
98.         build(0,1,n); 
99.         printf("Case %d:\n",ti++); 
100.         int ll,rr,h; 
101.         for(i=0;i<m;i++){ 
102.             scanf("%d %d %d",&ll,&rr,&h); 
103.             ll++,rr++; 
104.             if(ll==rr){ 
105.                 if(tree[0][ll]<=h){ 
106.                     printf("1\n"); 
107.                 }else{ 
108.                     printf("0\n"); 
109.                 } 
110.             }else{ 
111.                 printf("%d\n",solve(ll,rr,h)); 
112.             } 
113.  
114.         } 
115.     } 
116. return 0; 
117. }