算法-图论 - 随笔分类(第2页) - happy_codes

Nearest Common Ancestors(LCA)

摘要：Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is l 阅读全文

posted @ 2017-05-04 20:43 happy_codes 阅读(182) 评论(0) 推荐(0)

公路修建问题(二分+最小生成树)

摘要：Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 2061 Solved: 1184 Description OI island是一个非常漂亮的岛屿,自开发以来,到这儿来旅游的人很多。然而，由于该岛屿刚刚开发不久，所以那里的交通情况还是很糟糕。所以，OIE 阅读全文

posted @ 2017-03-24 22:07 happy_codes 阅读(309) 评论(0) 推荐(0)

Earth Hour(最短路)

摘要：Earth Hour Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1970 Accepted Submission(s): 781 Prob 阅读全文

posted @ 2017-03-08 20:21 happy_codes 阅读(205) 评论(0) 推荐(0)

Idiomatic Phrases Game(图论最短路)

摘要：Idiomatic Phrases Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3504 Accepted Submission(s 阅读全文

posted @ 2016-11-21 22:05 happy_codes 阅读(409) 评论(0) 推荐(0)

二分+最短路

摘要：二分+最短路 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu POJ 3662 二分+最短路 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld 阅读全文

posted @ 2016-11-16 10:46 happy_codes 阅读(381) 评论(0) 推荐(0)

Brain Network (medium)(DFS)

摘要：H - Brain Network (medium) Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u CodeForces 690C2 H - Brain Network (medium) Time Limi 阅读全文

posted @ 2016-09-30 21:16 happy_codes 阅读(232) 评论(0) 推荐(0)

ACM暑假集训第三周小结

摘要：这一周学的图论,学了这么些两种存图的方法:邻接矩阵( map[n][n] ) , 邻接表( headlis[n] , vector<int> G[n] )存图的方法,各有各的好,我的理解是,如果不是那种非常稠密的图,类似于完全图这样的图,邻接表一般会快很多,毕竟减少了边的遍历。最小生成树 kru 阅读全文

posted @ 2016-07-31 18:30 happy_codes 阅读(224) 评论(0) 推荐(0)

H - Funny Car Racing

摘要：H - Funny Car Racing Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu H - Funny Car Racing Time Limit:1000MS Memory Limit:0KB 64bit IO F 阅读全文

posted @ 2016-07-28 18:43 happy_codes 阅读(215) 评论(0) 推荐(0)

D - Invitation Cards

摘要：D - Invitation Cards Time Limit:8000MS Memory Limit:262144KB 64bit IO Format:%lld & %llu Description In the age of television, not many people attend 阅读全文

posted @ 2016-07-28 11:00 happy_codes 阅读(190) 评论(0) 推荐(0)

Frogger

摘要：Frogger Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Frogger Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu 阅读全文

posted @ 2016-07-27 09:33 happy_codes 阅读(176) 评论(0) 推荐(0)

还是畅通工程

摘要：Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description 阅读全文

posted @ 2016-07-27 09:18 happy_codes 阅读(119) 评论(0) 推荐(0)

Til the Cows Come Home(最短路模板题)

摘要：Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Description Bess 阅读全文

posted @ 2016-07-27 09:06 happy_codes 阅读(201) 评论(0) 推荐(0)

D - Find a way

摘要：D - Find a way Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u D - Find a way Description Pass a year learning in Hangzhou, yifen 阅读全文

posted @ 2016-07-16 16:03 happy_codes 阅读(197) 评论(0) 推荐(0)

happy_code

随笔分类 - 算法-图论

公告