图论
文章平均质量分 79
码码要洗手
我很重要
展开
-
填充管道
点击打开链接TunnelsTimeLimit: 1 Second MemoryLimit: 32 MegabyteTotalsubmit: 86 Accepted: 33 DescriptionWater can flow around, does not it? And it can also flow along a tun原创 2014-02-18 15:37:51 · 644 阅读 · 0 评论 -
poj Colored Sticks(2513)
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 30201 Accepted: 7975DescriptionYou are given a bunch of wooden sticks. Each endpoint of原创 2014-08-12 15:39:35 · 543 阅读 · 0 评论 -
poj Play on Words(1386)
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9496 Accepted: 3284DescriptionSome of the secret doors contain a very interesting word pu原创 2014-08-11 16:02:22 · 547 阅读 · 0 评论 -
poj Door Man(1300)
Door ManTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2057 Accepted: 813DescriptionYou are a butler in a large mansion. This mansion has so many rooms原创 2014-08-11 10:50:40 · 519 阅读 · 0 评论 -
hdu Minimum Transport Cost(1385)
题目大意:给定N个城市原创 2014-08-10 20:18:11 · 482 阅读 · 0 评论 -
网络流3最小路径覆盖问题
题目大意:对于给定的原创 2014-07-23 15:55:24 · 876 阅读 · 0 评论 -
网络流2太空飞行计划问题
题目大意:某教授原创 2014-07-23 15:31:42 · 595 阅读 · 0 评论 -
网络流1飞行员配对方案问题
题目大意:给定一些外籍飞行员与英国飞行员的原创 2014-07-23 11:30:46 · 570 阅读 · 0 评论 -
uva_risk
点击打开链接先输入19行,每行先是一个数字J,接着跟着J个数字,输入的每个数字x表示行数i与x两点是联通的(且距离为1)。随后再输入一个数字n,紧跟着n行,每行输入一个出发点和目的地点,输出两个点之间的最小距离。直接用Floyd算法套模板搞定。#include#includeconst int INF = 1000;int ma原创 2014-03-03 09:10:59 · 528 阅读 · 0 评论 -
10048 - Audiophobia
点击打开链接用Floyd 算法求任意两个点相通路径中的所有路径长度最长的值。只用FLOYD 和决策改变一下即可。#includeint n,m,t;const int INF = 100000000;const int maxn = 110;int dist[maxn][maxn];int maxs(int a,int b){ return原创 2014-03-03 12:42:06 · 503 阅读 · 0 评论 -
10034 - Freckles
点击打开链接求最小生成树,可用PRIM 也可用 KRUSKRAL 。#include#include#includeint father[110];double x[110],y[110];typedef struct{ int st; int en; double dist;}Node;Node g[5100];原创 2014-03-03 12:45:18 · 558 阅读 · 0 评论 -
欧拉图
点击打开链接Eular GraphTimeLimit: 1 Second MemoryLimit: 32 MegabyteTotalsubmit: 53 Accepted: 38 DescriptionEular graph is a graph that you can start from one vertex X原创 2014-02-18 15:18:03 · 496 阅读 · 0 评论 -
Minimum time
点击打开链接Minimum timeTimeLimit: 1 Second MemoryLimit: 64 MegabyteTotalsubmit: 140 Accepted: 52 DescriptionTom gets up late today. In order to go to work faster, Tom原创 2014-02-18 15:05:47 · 573 阅读 · 0 评论 -
poj Frogs' Neighborhood(1659)
Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 7293 Accepted: 3149 Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名原创 2014-08-14 16:05:08 · 517 阅读 · 0 评论