生成树
lonely_wind_
路漫漫兮
展开
-
2020杭电HDU-6832多校第六场A Very Easy Graph Problem(最短路转最小生成树+dfs)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6832博客园食用链接:https://www.cnblogs.com/lonely-wind-/p/13455277.htmlAn undirected connected graph has n nodes and m edges, The i-th edge’s length is 2i2^i2i. Each node i has a value aia_iai, which is either 0 o原创 2020-08-07 21:12:54 · 472 阅读 · 0 评论 -
CodeForces 592D-Super M(树上生成树+树的直径之树DP的缺点)
题目链接:https://codeforces.com/problemset/problem/592/D博客园食用链接:Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that consists of n cities, connected by n - 1 bidirectional原创 2020-08-06 09:10:04 · 368 阅读 · 0 评论 -
Desert King--POJ2728 最优比例生成树--二分
Time Limit:3000MS Memory Limit:65536K DescriptionDavid the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over ...原创 2019-07-23 19:41:05 · 261 阅读 · 0 评论 -
Slim Span--POJ 3522&UVA 1395--最小生成树+枚举
Slim SpanTime Limit: 5000MS Memory Limit: 65536K题目链接http://poj.org/problem?id=3522DescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as follows.The ...原创 2019-07-23 14:22:22 · 268 阅读 · 0 评论