Count the Colors （线段树区间染色问题）

最新推荐文章于 2022-03-01 18:22:56 发布

ldu商正昌

最新推荐文章于 2022-03-01 18:22:56 发布

阅读量780

点赞数 1

分类专栏：线段树文章标签： Count the Colors 线段树区间染色

本文链接：https://blog.csdn.net/nb_weige/article/details/98779241

版权

该博客讨论了如何使用线段树处理区间染色问题，其中后染色的区间可能覆盖之前的部分。任务是计算最后能观察到的各颜色段的数量。输入包含彩色段的起始和结束点以及颜色，输出按颜色索引排列的段计数。博客提供了样例输入和输出，并解释了将区间视为点以避免遗漏的方法。

摘要由CSDN通过智能技术生成

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, y