线段树专题—ZOJ1610 Count the Colors（涂区间，直接tag标记）

Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.

Your task is counting the segments of different colors you can see at last.

Input

The first line of each data set contains exactly one integer n, 1 <= n <= 8000, equal to the number of colored segments.

Each of the following n lines consists of exactly 3 nonnegative integers separated by single spaces:

x1 x2 c

x1 and x2 indicate the left endpoint and right endpoint of the segment, c indicates the color of the segment.

All the numbers are in the range [0, 8000], and they are all integers.

Input may contain several data set, process to the end of file.

<b< dd="">

Output

Each line of the output should contain a color index that can be seen from the top, following the count of the segments of this color, they should be printed according to the color index.

If some color can't be seen, you shouldn't print it.

Print a blank line after every dataset.

<b< dd="">

Sample Input

5
0 4 4
0 3 1
3 4 2
0 2 2
0 2 3
4
0 1 1
3 4 1
1 3 2
1 3 1
6
0 1 0
1 2 1
2 3 1
1 2 0
2 3 0
1 2 1

Sample Output

1 1
2 1
3 1

1 1

0 2
1 1

题意：就是在一段区间涂成一种颜色，然后最后问你，每种颜色涂成了多少种不同颜色。

题解：注意一下范围所有都是8000，所以和hdu1698差不了太多，也是区间标记，根

的优先值大于儿子的，这样就是这道题的解法，最后一次总的询问，将color 1-8000染好

颜色，然后就处理一下就好了。

 #include<cstdio>
 #include<algorithm>
 #include<iostream>
 #include<cmath>
 #include<climits>
 using namespace std;
 const int MAXN=;
 bool a[MAXN]={};
 int b[MAXN]={},n,num=,color[MAXN],tree[MAXN*]={},x,y,z;
 void change(int l,int r,int p,int x,int y,int zhi)
 {
     if (l>r) return;
     if (l==x&&r==y) tree[p]=zhi;
     else
     {
         if (tree[p]!=-)
         {
             tree[p*]=tree[p*+]=tree[p];
             tree[p]=-;
         }
         int mid=(l+r)>>;
         if (y<=mid) change(l,mid,p*,x,y,zhi);
         else if (x>=mid+) change(mid+,r,p*+,x,y,zhi);
              else
              {
                  change(l,mid,p*,x,mid,zhi);
                  change(mid+,r,p*+,mid+,y,zhi);
              }
     }
 }
 void query(int l,int r,int p){
     if (l>r) return;
     if (tree[p]!=-)
     {
         for (int i=l;i<=r;i++)
             color[i]=tree[p];
     }
     else
     {
         if (l==r) return;
         int mid=(l+r)>>;
         query(l,mid,p*);
         query(mid+,r,p*+);
     }
 }
 int main()
 {
     while (~scanf("%d",&n))
     {
         num=;
         for (int i=;i<MAXN*;i++)
             tree[i]=-;
         for (int i=;i<MAXN;i++)
             a[i]=b[i]=,color[i]=MAXN-;
         for (int i=;i<=n;i++)
         {
             scanf("%d%d%d",&x,&y,&z);
             if (x!=y) change(,,,x+,y,z);
         }
         query(,,);
         for (int i=;i<=;i++)
             if (color[i]!=color[i-]) a[color[i]]=,b[color[i]]++;
         for (int i=;i<MAXN-;i++)
         {
             if (a[i]) cout<<i<<" "<<b[i]<<endl;
         }
         cout<<endl;
     }
 }