本文介绍了ZOJ 1610 Count the Colors问题，这是一个涉及线段树的算法题目。内容包括题目描述、输入输出格式以及样例。文章强调了线段树在处理覆盖线段计数时的难点，如避免重复计数、线段拆分后的颜色维护等，并提示读者查看代码以了解更多细节。
Count the Colors
Time Limit: 2000 msMemory Limit: 65536 KB
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
最低0.47元/天 解锁文章
扫一扫
694
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
