区间取点问题

最新推荐文章于 2020-04-28 20:40:34 发布

傻笨

最新推荐文章于 2020-04-28 20:40:34 发布

阅读量1.1k

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/u010195743/article/details/42611883

版权

本文深入研究了区间取点问题，探讨了不同的选取策略及其应用场景。从最简单的平均分配到复杂的最优算法，分析了它们的效率和适用条件。通过实例解析，帮助读者理解如何在给定区间内选择合适的点，以满足特定需求。

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

数轴上有n个闭区间[ai,bi]。取尽量少的点，使得每个区间内都至少有一个点（不同区间内含的点可以是同一个）。
例题如下：
N one dimensional kingdoms are represented as intervals of the form [ai , bi] on the real line.
A kingdom of the form [L, R] can be destroyed completely by placing a bomb at a point x on the real line if L
≤ x ≤ R.
Your task is to determine minimum number of bombs required to destroy all the one dimensional kingdoms.
Input

First line of the input contains T denoting number of test cases.
For each test case, first line contains N denoting the number of one dimensional kingdoms.
For each next N lines, each line contains two space separated integers ai and bi.
Output

For each test case , output an integer denoting the minimum number of bombs required.
Constraints

Subtask 1 (20 points) : 1 ≤ T ≤ 100 , 1 ≤ N ≤ 100 , 0 ≤ ai ≤ bi ≤500
Subtask 2 (30 points) : 1 ≤ T