poj
文章平均质量分 87
tt_twilight
当你身处不那么如意的环境时,要么赶紧远离,要么
尽力改变。
展开
-
poj 1703 Find them, Catch them
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 42482 Accepted: 13075DescriptionThe police office in Tadu City decides to say ends原创 2016-11-10 14:54:34 · 179 阅读 · 0 评论 -
poj 1988 Cube Stacking
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 24167 Accepted: 8479Case Time Limit: 1000MSDescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,0原创 2016-11-17 18:40:33 · 220 阅读 · 0 评论 -
poj并查集专练
并查集小结并查集大体分为三个:普通的并查集,带种类的并查集,扩展的并查集(主要是必须指定合并时的父子关系,或者统计一些数据,比如此集合内的元素数目。)POJ-1182经典的种类并查集POJ-1308用并查集来判断一棵树。。注意空树也是树,死人也是人。POJ-1611裸地水并查集POJ-1703种类并查集POJ-1988看上去似乎和种类并查集无关,但其实仔转载 2016-11-18 11:13:37 · 282 阅读 · 0 评论 -
poj 3186 Treats for the Cows
题目链接:http://poj.org/problem?id=3186Treats for the CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5731 Accepted: 2964DescriptionFJ h原创 2017-03-13 15:16:14 · 213 阅读 · 0 评论 -
hdu1394 Minimum Inversion Number
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1394Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 195原创 2017-03-15 20:49:02 · 337 阅读 · 0 评论