加油 ( •̀ ω •́ )y！

随笔分类 -  POJ

POJ 1236 Network of Schools（tarjan）
摘要：Network of Schools Description A number of schools are connected to a computer network. Agreements have been developed among those schools: each schoo 阅读全文
posted @ 2018-09-20 15:41 皮皮虎 阅读(143) 评论(0) 推荐(0)
POJ 2778 DNA Sequence （ac自动机+矩阵快速幂）
摘要：DNA Sequence Description It's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA 阅读全文
posted @ 2018-08-29 14:33 皮皮虎 阅读(205) 评论(0) 推荐(0)
POJ 1511 Invitation Cards(逆向思维 SPFA)
摘要：Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want 阅读全文
posted @ 2018-08-19 20:39 皮皮虎 阅读(153) 评论(0) 推荐(0)
POJ 3660 Cow Contest（floyed运用）
摘要：Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than o 阅读全文
posted @ 2018-08-19 17:27 皮皮虎 阅读(168) 评论(0) 推荐(0)
POJ 3259 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 one- 阅读全文
posted @ 2018-08-19 13:05 皮皮虎 阅读(132) 评论(0) 推荐(0)
POJ 3268 Silver Cow Party
摘要：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 皮皮虎 阅读(113) 评论(0) 推荐(0)
POJ 1797 Heavy Transportation（Dijkstra运用）
摘要：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 皮皮虎 阅读(215) 评论(0) 推荐(0)
POJ 2253 Frogger（SPFA运用）
摘要：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 皮皮虎 阅读(153) 评论(0) 推荐(0)
POJ 2387 Til the Cows Come Home(最短路模板)
摘要：题目链接：http://poj.org/problem?id=2387 题意：有n个城市点，m条边，求n到1的最短路径。n<=1000; m<=2000 就是一个标准的最短路模板。 阅读全文
posted @ 2018-08-18 09:55 皮皮虎 阅读(160) 评论(0) 推荐(0)
POJ 3311 Hie with the Pie 兼 Codevs 2800 送外卖（动态规划->TSP问题）
摘要：Description The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can affo 阅读全文
posted @ 2018-08-15 17:37 皮皮虎 阅读(230) 评论(0) 推荐(0)
POJ 3254 Corn Fields(状态压缩DP入门)
摘要：Description Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some 阅读全文
posted @ 2018-08-14 22:13 皮皮虎 阅读(159) 评论(0) 推荐(0)