题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1112 题意:n根线段,要拿走一些,使得任何的线段的左段没有在某一个线段的内部。 其实说白了,就是拿走最少的线段,使得不重合。 数据量很小,100,直接LIS O(n^2)搞。 首先按x从小到大排, ...
分类:
其他好文 时间:
2016-09-19 22:28:38
阅读次数:
135
NYOJ 239:http://acm.nyist.net/JudgeOnline/problem.php?pid=239 ural 1109 :http://acm.timus.ru/problem.aspx?space=1&num=1109 NYOJ 月老的难题,是裸的最大匹配,很烦的是邻接阵超 ...
分类:
编程语言 时间:
2016-09-19 01:17:12
阅读次数:
217
By the Underground or by Foot? Time limit: 1.0 secondMemory limit: 64 MB Imagine yourself in a big city. You want to get from point A to point B. To d ...
分类:
其他好文 时间:
2016-09-15 21:37:21
阅读次数:
195
Werewolf Time limit: 1.0 secondMemory limit: 64 MB Knife. Moonlit night. Rotten stump with a short black-handled knife in it. Those who know will unde ...
分类:
其他好文 时间:
2016-09-15 19:15:56
阅读次数:
170
链剖即可。其实就是利用了链剖后子树都在一段连续的区间内所以可以做到O(logn)查询和修改。 线段树细节打错了。。要专心!肉眼差错都能找出一堆出来显然是不行的!。 1199 Money out of Thin Air 题目来源: Ural 基准时间限制:1 秒 空间限制:131072 KB 分值: ...
分类:
其他好文 时间:
2016-09-15 14:53:28
阅读次数:
200
Ivan's Car Time limit: 1.5 secondMemory limit: 64 MB The world is in danger! Awful earthquakes are detected all over the world. Houses are destroyed, ...
分类:
其他好文 时间:
2016-09-13 01:29:28
阅读次数:
183
1741. Communication Fiend Time limit: 1.0 second Memory limit: 64 MB Kolya has returned from a summer camp and now he's a real communication fiend. He ...
分类:
其他好文 时间:
2016-09-10 14:41:29
阅读次数:
287
Non-Yekaterinburg Subway Time limit: 1.0 secondMemory limit: 64 MB A little town started to construct a subway. The peculiarity of the town is that it ...
分类:
其他好文 时间:
2016-09-09 22:17:01
阅读次数:
204
Topological Sorting Time limit: 1.0 secondMemory limit: 64 MB Michael wants to win the world championship in programming and decided to study N subjec ...
分类:
其他好文 时间:
2016-09-09 13:39:00
阅读次数:
154
Penguin-Avia Time limit: 1.0 secondMemory limit: 64 MB The Penguin-Avia airline, along with other Antarctic airlines, experiences financial difficulti ...
分类:
其他好文 时间:
2016-09-09 10:21:50
阅读次数:
249