码码要洗手

点击打开链接 Tunnels TimeLimit: 1 Second   MemoryLimit: 32 Megabyte Totalsubmit: 86   Accepted: 33   Description Water can flow around, does not it? And it can also flow along a tun

Colored Sticks Time Limit: 5000MS   Memory Limit: 128000K Total Submissions: 30201   Accepted: 7975 Description You are given a bunch of wooden sticks. Each endpoint of

Play on Words Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 9496   Accepted: 3284 Description Some of the secret doors contain a very interesting word pu

Door Man Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2057   Accepted: 813 Description You are a butler in a large mansion. This mansion has so many rooms

题目大意： 给定N个城市

题目大意： 对于给定的

题目大意： 某教授

题目大意： 给定一些外籍飞行员与英国飞行员的

点击打开链接 先输入19行，每行先是一个数字J，接着跟着J个数字，输入的每个数字x表示行数i与x两点是联通的（且距离为1）。随后再输入一个数字n，紧跟着n行，每行输入一个出发点和目的地点，输出两个点之间的最小距离。 直接用Floyd算法套模板搞定。 #include #include const int INF = 1000; int ma

点击打开链接 用Floyd 算法求任意两个点相通路径中的所有路径长度最长的值。只用FLOYD 和决策改变一下即可。 #include int n,m,t; const int INF = 100000000; const int maxn = 110; int dist[maxn][maxn]; int maxs(int a,int b){ return

点击打开链接 求最小生成树，可用PRIM 也可用 KRUSKRAL 。 #include #include #include int father[110]; double x[110],y[110]; typedef struct{ int st; int en; double dist; }Node; Node g[5100];

点击打开链接 Eular Graph TimeLimit: 1 Second   MemoryLimit: 32 Megabyte Totalsubmit: 53   Accepted: 38   Description Eular graph is a graph that you can start from one vertex X

点击打开链接 Minimum time TimeLimit: 1 Second   MemoryLimit: 64 Megabyte Totalsubmit: 140   Accepted: 52   Description Tom gets up late today. In order to go to work faster, Tom

Frogs' Neighborhood Time Limit: 5000MS   Memory Limit: 10000K Total Submissions: 7293   Accepted: 3149   Special Judge Description 未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名