图
莫宫天
莫愁前路无知己,天下谁人不识君。
展开
-
POJ - 2387----Til the Cows Come Home(Dijkstra)
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get ba原创 2017-02-19 21:36:18 · 294 阅读 · 0 评论 -
POJ - 3268----Silver Cow Party(Dijkstra)
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 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roa原创 2017-02-20 19:49:19 · 580 阅读 · 0 评论 -
POJ - 3259----Wormholes(Bellman-Ford)
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is原创 2017-02-20 19:57:12 · 332 阅读 · 0 评论 -
POJ - 1797----Heavy Transportation(Dijkstra)
Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cus原创 2017-02-19 21:40:07 · 324 阅读 · 0 评论 -
POJ - 1502----MPI Maelstrom(Dijkstra)
BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’s research advis原创 2017-02-21 19:57:16 · 312 阅读 · 0 评论 -
POJ - 3660----Cow Contest (Floyd)
题目大意:有n头牛比赛,m种比赛结果,求一共有多少头牛的排名被确定了。 思路:如果一头牛与所有别的牛的比赛结果都确定,就是说这头牛的排名确定了,可用Floyd来做#include<algorithm> #include<iostream> #include<stdlib.h> #include<cstring> #include<cstdio> #include<cstdio> #include<原创 2017-02-21 20:05:47 · 343 阅读 · 0 评论 -
POJ 1847----Tram(Floyd)
DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the inte原创 2017-02-23 20:48:14 · 371 阅读 · 2 评论