2014 网选 广州赛区 hdu 5023 A Corrupt Mayor's Performance Art

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 #define N 1000005
 using namespace std;

 int c[];
 int tree[N*];//正值表示该节点所管理的区间的颜色是纯色，-1表示的是非纯色
 int n, m; 

 void buildT(int ld, int rd, int p){
     if(ld <= rd){
         tree[p] = ;//初始每一个节点的颜色全部都是2
         if(ld == rd) return;
         int mid=(ld + rd)>>;
         buildT(ld, mid, p<<);
         buildT(mid+, rd, p<<|);
     }
 }

 void updateT(int ld, int rd, int a, int b, int col, int p){

     if(ld > rd) return ;

     if(tree[p] == col) return ;

     if(ld == a && rd == b){
         tree[p] = col;
         return ;
     }
     int mid = (ld + rd)>>;

     if(tree[p] != -){// p所管的区间之前是纯色，现在不是纯色了，向下更新其孩子节点的颜色为它的颜色
         tree[p<<] = tree[p<< | ] = tree[p];
         tree[p] = -;
     }

     if(a > mid)
         updateT(mid+, rd, a, b, col, p<< | );
     else if(b <= mid)
         updateT(ld, mid, a, b, col, p<<);
     else{
         updateT(ld, mid, a, mid, col, p<<);
         updateT(mid+, rd, mid+, b, col, p<< | );
     }
 }

 int cnt;

 void querryT(int ld, int rd, int a, int b, int p){
     if(ld>rd) return ; 

     if(tree[p] != -){//一直找到纯色的区间！
         c[tree[p]]=;
         return ;
     }

     int mid = (ld+rd)>>;
     if(a > mid)
         querryT(mid+, rd, a, b, p<< | );
     else if(b <= mid)
         querryT(ld, mid, a, b, p<<) ;
     else{
         querryT(ld, mid, a, mid, p<<);
         querryT(mid+, rd, mid+, b, p<< | );
     }
 }

 int main(){
     while(scanf("%d%d", &n, &m) && (n || m)){
         char ch[];
         int a, b, k;
         buildT(, n, );
         while(m--){
             scanf("%s", ch);
             if(ch[] == 'P'){
                 scanf("%d%d%d", &a, &b, &k);
                 updateT(, n, a, b, k, );
             }
             else{
                 scanf("%d%d", &a, &b);
                 memset(c, , sizeof(c));
                 querryT(, n, a, b, );
                 int i;
                 for(i=; i<=; ++i)
                     if(c[i]){
                          printf("%d", i);
                          break;
                     }
                 for(++i; i<=; ++i)
                     if(c[i]) printf(" %d", i);
                 printf("\n");
             }
         }
     }
     return ;
 }