zju1610 Count the Colors

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.

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.

题解：

写过了例1~4，这题并不难，但要注意一些地方：

题目每次给的染色段是把[x1,x2]染成c，但不是把x1～x1的所有点都染成c。 

代码：

核心程序

m := (l+r) div 2;
  if (a=l)and(b=r) then 

    Tree[p].cover:=color
  else begin
         if Tree[p].cover<>-1 then 

           begin
             Tree[p*2].cover:=Tree[p].cover;
             Tree[p*2+1].cover:=Tree[p].cover;
             Tree[p].cover := -1;
           end;
         if b<=m then Insert(p*2,l,m,a,b)
           else if a>=m then  Insert(p*2+1,m,r,a,b)
                  else begin
                         Insert(p*2,l,m,a,m);
                         Insert(p*2+1,m,r,m,b);
                       end;
         end;