
并查集
文章平均质量分 87
974792789
不要在能吃苦的年纪追求安逸。
展开
-
X-Plosives +uvalive+并查集+水题
A secret service developed a new kind of explosive that attain its volatile property only when a speci c association of products occurs. Each product is a mix of two different simple compounds, to whi原创 2014-07-19 20:28:40 · 508 阅读 · 0 评论 -
Corporative Network +uvalive+并查集
Corporative Network A very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to N, organized its own computing a原创 2014-07-19 20:33:48 · 383 阅读 · 0 评论 -
畅通工程+并查集水题+hdu
畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30194 Accepted Submission(s): 15859 Problem Description 某省调查城镇交通状况,得到现有城镇道路原创 2014-07-26 23:40:00 · 424 阅读 · 0 评论 -
小希的迷宫 并查集+hdu
小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25737 Accepted Submission(s): 7927 Problem Description 上次Gardon的迷宫城堡小希玩了很久原创 2014-07-26 22:21:24 · 471 阅读 · 0 评论 -
Friends+uva+并查集
Friends There is a town with N citizens. It is known that some pairs of people are friends. According to the famous saying that The friends of my friends are my friends, too it follows that if原创 2014-07-27 20:27:09 · 484 阅读 · 0 评论 -
How Many Tables 并查集+水题+hdu
How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13167 Accepted Submission(s): 6431 Problem Description Today is原创 2014-07-26 22:18:58 · 456 阅读 · 0 评论