可能有些大佬们不了解那只题解的思路.....蒟蒻说一下QAQ
by l_water @ 2018-10-26 23:59:52
1. 枚举每个点(共n个)
2. 因为k个矩形永远（最优性）大于k-1个，那么只需要正好找k个就好了
3. 枚举点的过程中就是判断在哪个矩形中，在dfs中判断是否有矩形重叠，dfs两种状态，该矩形已经确定和还未被确定。
4. 那么分别dfs更新把点加进去(记得回溯)
5. 最后每一次n个确定完毕，就判断是否更新答案即可啦
by l_water @ 2018-10-27 00:04:01
您可以at chen_zhe以加强数据（逃
qwq
by qsmoonzh @ 2018-10-27 00:07:27
话说这题我不会qwq
by qsmoonzh @ 2018-10-27 00:08:04
@[qsmoonzh](/space/show?uid=96546) 真哒？？？
by l_water @ 2018-10-27 00:08:09
@[qsmoonzh](/space/show?uid=96546) 我也不会QAQ，看题解的QAQ
by l_water @ 2018-10-27 00:08:21
加强数据
by l_water @ 2018-10-27 00:08:49
# $\Huge\text{orz} \%\%\%\%\%$
by NaCly_Fish @ 2018-10-27 00:27:24
@[NaCly_Fish](/space/show?uid=115864) 您玩笑啦QAQ
by l_water @ 2018-10-27 00:29:41
# QAQAQAQAQAQAQAQAQAQAQWQWQWQWQWQWQWQWQWQWQWQW
by fengsiyuan @ 2019-04-17 17:31:07