poj1273
摘要：
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 56468 Accepted: 21695 Description Every time it rai... 阅读全文
posted @ 2014-08-27 10:51 胖胖的乓乓 阅读(102) 评论(0) 推荐(0)
poj1511 Invitation Cards
摘要：
poj511 题意：就是求所有的节点到节点 1，然后从节点1返回的最小距离的和。 简单SPFA，和poj 3268 无多少差异。 #include#include#include#include#include#include#include#include#include#include#i... 阅读全文
posted @ 2014-08-20 16:15 胖胖的乓乓 阅读(92) 评论(0) 推荐(0)
zoj1456 Minimum Transport Cost
摘要：
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1456 题目大意：有N个城市，两个城市之间要么有一条运输路线，要么没有。现在有一些货物需要从一个城市运往另一个城市。运输费用包含两部分：通过两个城市之间运输线路的费用，以及... 阅读全文
posted @ 2014-08-17 15:09 胖胖的乓乓 阅读(122) 评论(0) 推荐(0)
poj3259 Wormholes
摘要：
Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a o... 阅读全文
posted @ 2014-08-14 09:44 胖胖的乓乓 阅读(123) 评论(0) 推荐(0)
poj3268俩次SPFA。。。。。
摘要：
Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ ... 阅读全文
posted @ 2014-08-13 20:23 胖胖的乓乓 阅读(127) 评论(0) 推荐(0)
poj1679 The Unique MST
摘要：
题目大意:给定一个联无向网，判断它的最小生成树是否唯一。 The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20421 Accepted: 7183DescriptionGiven a conne... 阅读全文
posted @ 2014-08-11 13:58 胖胖的乓乓 阅读(114) 评论(0) 推荐(0)
poj 1979 Red and Black
摘要：
Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22300 Accepted: 12041 Description There is a rectangular room... 阅读全文
posted @ 2014-08-04 21:10 胖胖的乓乓 阅读(133) 评论(0) 推荐(0)
zoj 1649 Rescue
摘要：
Rescue Time Limit: 2 Seconds Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is describ... 阅读全文
posted @ 2014-08-04 10:42 胖胖的乓乓 阅读(114) 评论(0) 推荐(0)
最短路模板（dijkstra+邻接表）
摘要：
#include#include#include#include#include#include#include#include#includeusing namespace std;#define maxn 550#define MM 10000000int V[maxn];int d[max... 阅读全文
posted @ 2014-07-23 20:41 胖胖的乓乓 阅读(525) 评论(0) 推荐(0)
Uva 10034 - Freckles
摘要：
题目大意： 我理解为给你N个城市的坐标，求所有城市连起来的最小距离。 #include#include#include#includeusing namespace std;#define maxn 105#define MM 1000000000int n,T;struct aa{ d... 阅读全文
posted @ 2014-07-10 20:19 胖胖的乓乓 阅读(120) 评论(0) 推荐(0)
浙公网安备 33010602011771号