01.图论 - (2)最小生成树MST - 随笔分类 - Dilthey

XTU 1261 - Roads - [最小割][2017湘潭邀请赛B题(江苏省赛)]

摘要：之前在网上搜了一个下午没搜到这道题的题解，然后同时又对着叉姐写的两行字题解看了一个下午；虽然基本上已经知道了这题的思路，但愣是因为自己代码实现起来太繁复，外加不确定正确性，没敢码…… 但是一道题肝了一下午没肝出来，就要放弃的话，怕是太扎心了，忍不住就跑去ICPCCamp.Post问叉姐了（http 阅读全文

posted @ 2017-08-21 18:44 Dilthey 阅读(522) 评论(0) 推荐(0) 编辑

ECNU 3247 - 铁路修复计划

摘要：Time limit per test: 2.0 seconds Time limit all tests: 15.0 seconds Memory limit: 256 megabytes Time limit per test: 2.0 seconds Time limit all tests: 阅读全文

posted @ 2017-05-12 23:12 Dilthey 阅读(355) 评论(0) 推荐(0) 编辑

POJ 2377 - Bad Cowtractors

摘要：题目链接：http://poj.org/problem?id=2377 Time Limit: 1000MS Memory Limit: 65536K Description Bessie has been hired to build a cheap internet network among 阅读全文

posted @ 2017-04-12 12:31 Dilthey 阅读(164) 评论(0) 推荐(0) 编辑

POJ 3723 - Conscription

摘要：Time Limit: 1000MS Memory Limit: 65536K Description Windy has a country, and he wants to build an army to protect his country. He has picked up N girl 阅读全文

posted @ 2017-04-06 22:51 Dilthey 阅读(260) 评论(0) 推荐(0) 编辑

POJ 3522 - Slim Span - [kruskal求MST]

摘要：题目链接：http://poj.org/problem?id=3522 Time Limit: 5000MS Memory Limit: 65536K Description Given an undirected weighted graph G, you should find one of s 阅读全文

posted @ 2017-04-05 17:32 Dilthey 阅读(231) 评论(0) 推荐(0) 编辑

随笔分类 - 01.图论 - (2)最小生成树MST

公告