摘要:
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 ≤ X ≤ 阅读全文
posted @ 2018-08-18 16:16
皮皮虎
阅读(114)
评论(0)
推荐(0)
摘要:
Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who t 阅读全文
posted @ 2018-08-18 15:49
皮皮虎
阅读(216)
评论(0)
推荐(0)
摘要:
Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to vis 阅读全文
posted @ 2018-08-18 11:46
皮皮虎
阅读(155)
评论(0)
推荐(0)
摘要:
题目链接:http://poj.org/problem?id=2387 题意:有n个城市点,m条边,求n到1的最短路径。n<=1000; m<=2000 就是一个标准的最短路模板。 阅读全文
posted @ 2018-08-18 09:55
皮皮虎
阅读(160)
评论(0)
推荐(0)

浙公网安备 33010602011771号