上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 138 下一页
摘要: 链接: http://poj.org/problem?id=1703 题目: Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22289 Accepted: 6648 Description The police office in Tadu City d... 阅读全文
posted @ 2014-08-18 17:43 katago 阅读(174) 评论(0) 推荐(0)
摘要: 食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44835 Accepted: 13069 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知... 阅读全文
posted @ 2014-08-14 16:48 katago 阅读(434) 评论(0) 推荐(0)
摘要: 还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25926 Accepted Submission(s): 11549 Problem Description 某省调查乡村交通状况,得到的统计表中列出了... 阅读全文
posted @ 2014-08-13 17:37 katago 阅读(249) 评论(0) 推荐(0)
摘要: Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14276 Accepted Submission(s): 3188 Problem Description A tree is a well-known data st... 阅读全文
posted @ 2014-08-12 13:59 katago 阅读(180) 评论(0) 推荐(0)
摘要: More is better Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others) Total Submission(s): 14656 Accepted Submission(s): 5390 Problem Description Mr Wang want... 阅读全文
posted @ 2014-08-12 09:50 katago 阅读(200) 评论(0) 推荐(0)
摘要: 小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26372 Accepted Submission(s): 8130 Problem Description 上次Gardon的迷宫城堡小希玩了很久(见Pr... 阅读全文
posted @ 2014-08-11 17:43 katago 阅读(241) 评论(0) 推荐(0)
摘要: Ubiquitous Religions Time Limit: 5000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u [Submit] [Go Back] [Status] Description There are so many different religions in the world ... 阅读全文
posted @ 2014-08-11 16:19 katago 阅读(217) 评论(0) 推荐(0)
摘要: The Suspects Time Limit: 1000MSMemory Limit: 20000KB64bit IO Format: %I64d & %I64u [Submit] [Go Back] [Status] Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown ae... 阅读全文
posted @ 2014-08-11 14:17 katago 阅读(214) 评论(0) 推荐(0)
摘要: 并查集入门 并查集学习: l 并查集:(union-find sets) 一种简单的用途广泛的集合. 并查集是若干个不相交集合,能够实现较快的合并和判断元素所在集合的操作,应用很多,如其求无向图的连通分量个数等。最完美的应用当属:实现Kruskar算法求最小生成树。 l 并查集的精髓(即它的三种操作,结合实现代码模板进行理解): 1、Make_Set(x) 把每一个元素初始化为一个集合 ... 阅读全文
posted @ 2014-08-11 12:57 katago 阅读(457) 评论(0) 推荐(0)
摘要: How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13476 Accepted Submission(s): 6608 Problem Description Today is Igna... 阅读全文
posted @ 2014-08-11 12:53 katago 阅读(257) 评论(0) 推荐(0)
上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 138 下一页