树
Joyyiwei
这个作者很懒,什么都没留下…
展开
-
UVA - 567 Risk
题意:求图上两点的最短路程,Floyd的模板题,输入的时候是按1-19对应的连接点输入的#include #include #include #include using namespace std;const int MAXN = 30;int d[MAXN][MAXN],N,cas;void init(){ memset(d,0x3f3f3f3f,sizeof原创 2013-11-08 21:08:49 · 875 阅读 · 0 评论 -
UVA - 10048 Audiophobia
题意:理解了题解的意思:是求在多条从a到b的路径中,每条路径都要选出它的最大路段,最后在这些路段中选出最小的即可。稍微修改一下Floyd就可以了#include #include #include #include using namespace std;const int MAXN = 110;const int INF = 0x3f3f3f3f;int d[MAXN][MA原创 2013-11-08 23:54:37 · 774 阅读 · 0 评论 -
UVA - 10397 Connect the Campus
题意:最小生成树的问题,只不过这道题是有已经连好的m组点,将他们置0#include #include #include #include #include using namespace std;const int MAXN = 800;const int INF = 0x3f3f3f3f;int n,m,u,v;double x[MAXN],y[MAXN],dis[MA原创 2013-11-09 10:19:24 · 804 阅读 · 0 评论 -
UVA - 10099 The Tourist Guide
题意:跟之前的一题Floyd是一样的,就是求路径中的最小值最大,然后求来回的次数,记住导游也要考虑进去#include #include #include #include using namespace std;const int MAXN = 110;int dp[MAXN][MAXN];int n,r,a,b,t;int main(){ int cas =原创 2013-11-09 11:00:16 · 900 阅读 · 0 评论 -
UVA - 10986 Sending email
题意:使用优先队列的Dijkstra算法的模板题,注意数组的大小,要开两倍的M,因为我们存的是两次#include #include #include #include #include using namespace std;const int MAXN = 21004;const int MAXM = 110004;const int INF = 0x3f3f3f3f;原创 2013-11-09 16:18:55 · 982 阅读 · 0 评论 -
FZU - 2087 统计树边
Description在图论中,树:任意两个顶点间有且只有一条路径的图。生成树:包含了图中所有顶点的一种树。最小生成树:对于连通的带权图(连通网)G,其生成树也是带权的。生成树T各边的权值总和称为该树的权,权最小的生成树称为G的最小生成树(Minimum Spanning Tree)。最小生成树可简记为MST。但是,对于一个图而言,最小生成树并不是唯一的。现在,给你一个连通原创 2013-12-12 22:20:18 · 914 阅读 · 0 评论 -
UVA - 1494 Qin Shi Huang's National Road System (类次小生成树)
DescriptionDuring the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China -- they were Qi, Chu, Yan, Han, Zhao, Wei and Qin. Ying Zheng was the king of the原创 2014-07-21 20:12:04 · 1176 阅读 · 0 评论 -
POJ - 1679 The Unique MST (次小生成树)
DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of原创 2014-07-26 16:14:13 · 998 阅读 · 0 评论 -
POJ - 3522 Slim Span (kruskal+枚举)
DescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1,v2, …, vn}原创 2014-07-26 18:38:49 · 1011 阅读 · 0 评论