ACM_图论
defense881
Noting is impossiable!Believe in yourself!
展开
-
poj 2942&&uva 3523 Knights of the Round Table(图的连通性)
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 9663 Accepted: 3129 Description Being a knight is a very attractive career: search原创 2014-08-10 18:42:47 · 894 阅读 · 0 评论 -
poj 2421 Constructing Roads(最小生成树 kruskal算法)
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19457 Accepted: 8103 Description There are N villages, which are numbered from 1 to N,原创 2014-08-11 14:23:41 · 787 阅读 · 0 评论 -
poj 1258 Agri-Net(最小生成树 prime算法)
Agri-Net http://poj.org/problem?id=1258 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40013 Accepted: 16283 Description Farmer John has been elected may原创 2014-08-11 16:10:35 · 752 阅读 · 0 评论 -
poj 2240 Arbitrage(最短路径)
Arbitrage 点击打开题目链接 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15931 Accepted: 6706 Description Arbitrage is the use of discrepancies in currency exch原创 2014-09-11 15:02:53 · 817 阅读 · 0 评论 -
最短路 floyd 邻接矩阵形式(hiho 24周)
两个点之间会有不止一条路径,所以要特殊处理下; #include #include #include #include #include #include #include #include #include #include #define max(a,b) (a>b?a:b) #define min(a,b) (a<b?a:b) #define inf 0x3f3f3f3原创 2014-12-15 13:07:27 · 689 阅读 · 0 评论