随笔分类 -  数据结构 -- 并查集

上一页 1 2
ZOJ3261:Connections in Galaxy War(逆向并查集)
摘要：Connections in Galaxy War Time Limit: 3 Seconds Memory Limit: 32768 KB 题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3261 Descript 阅读全文
posted @ 2018-11-27 00:25 heyuhhh 阅读(246) 评论(0) 推荐(0)
POJ2912:Rochambeau(带权并查集)
摘要：Rochambeau 题目链接：http://poj.org/problem?id=2912 Description: N children are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the 阅读全文
posted @ 2018-11-27 00:06 heyuhhh 阅读(325) 评论(0) 推荐(0)
POJ1308：Is It A Tree?（并查集）
摘要：Is It A Tree? 题目链接：http://poj.org/problem?id=1308 Description: A tree is a well-known data structure that is either empty (null, void, nothing) or is 阅读全文
posted @ 2018-11-26 23:35 heyuhhh 阅读(270) 评论(0) 推荐(0)
HDU1272：小希的迷宫（并查集）
摘要：小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 67049 Accepted Submission(s): 21037 题目链接:ht 阅读全文
posted @ 2018-11-26 23:27 heyuhhh 阅读(146) 评论(0) 推荐(0)
POJ2492：A Bug's Life（种类并查集）
摘要：A Bug's Life 题目链接：http://poj.org/problem?id=2492 Description: Background : Professor Hopper is researching the sexual behavior of a rare species of bu 阅读全文
posted @ 2018-11-22 23:50 heyuhhh 阅读(337) 评论(0) 推荐(0)
POJ1984：Navigation Nightmare（带权并查集）
摘要：Navigation Nightmare 题目链接：http://poj.org/problem?id=1984 Description: Farmer John's pastoral neighborhood has N farms (2 <= N <= 40,000), usually numb 阅读全文
posted @ 2018-11-22 23:42 heyuhhh 阅读(285) 评论(0) 推荐(0)
POJ1733：Parity Game(离散化+带权并查集)
摘要：Parity Game 题目链接：http://poj.org/problem?id=1733 Description: Now and then you play the following game with your friend. Your friend writes down a sequ 阅读全文
posted @ 2018-11-22 23:26 heyuhhh 阅读(365) 评论(0) 推荐(0)
POJ1456：Supermarket（并查集+贪心）
摘要：Supermarket 题目链接：http://poj.org/problem?id=1456 Description: A supermarket has a set Prod of products on sale. It earns a profit px for each product x 阅读全文
posted @ 2018-11-22 00:05 heyuhhh 阅读(198) 评论(0) 推荐(0)
POJ1417:True Liars（DP+带权并查集）
摘要：True Liars Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16338 Accepted Submission(s): 5724 题目链 阅读全文
posted @ 2018-11-21 23:39 heyuhhh 阅读(283) 评论(0) 推荐(0)
HDU3038：How Many Answers Are Wrong(带权并查集)
摘要：How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16338 Accepted Submiss 阅读全文
posted @ 2018-11-21 23:18 heyuhhh 阅读(177) 评论(0) 推荐(0)
HDU1213：How Many Tables（并查集）
摘要：How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46694 Accepted Submission(s): 233 阅读全文
posted @ 2018-11-21 23:10 heyuhhh 阅读(212) 评论(0) 推荐(0)
POJ1611:The Suspects（并查集）
摘要：The Suspects 题目链接：http://poj.org/problem?id=1611 Description: Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, wa 阅读全文
posted @ 2018-11-19 22:24 heyuhhh 阅读(310) 评论(0) 推荐(0)
POJ2236：Wireless Network（并查集）
摘要：Wireless Network 题目链接：http://poj.org/problem?id=2236 Description: An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) 阅读全文
posted @ 2018-11-19 22:14 heyuhhh 阅读(260) 评论(0) 推荐(0)
POJ1182：食物链(并查集)
摘要：食物链 Description: 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述： 第一种说法是"1 X 阅读全文
posted @ 2018-11-18 23:07 heyuhhh 阅读(320) 评论(0) 推荐(0)
BZOJ1202：狡猾的商人（带权并查集）
摘要：1202: [HNOI2005]狡猾的商人 题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=1202 Description: 刁姹接到一个任务，为税务部门调查一位商人的账本，看看账本是不是伪造的。账本上记录了n个月以来的收入情况，其中第i 阅读全文
posted @ 2018-11-18 13:09 heyuhhh 阅读(407) 评论(0) 推荐(1)

上一页 1 2