随笔分类 -  POJ

POJ-1860 Currency Exchange 【spfa判负环】
摘要：Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and perf 阅读全文
posted @ 2017-05-19 19:30 Robin! 阅读(305) 评论(0) 推荐(0)
POJ-2195 Going Home 【费用流】
摘要：Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver 阅读全文
posted @ 2017-05-02 20:37 Robin! 阅读(266) 评论(0) 推荐(0)
POJ-1273 Drainage Ditches 【最大流】
摘要：Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by wa 阅读全文
posted @ 2017-04-20 19:59 Robin! 阅读(166) 评论(0) 推荐(0)
POJ-1236 Network of Schools 【强连通分量+缩点】
摘要：Description A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list 阅读全文
posted @ 2017-04-18 22:32 Robin! 阅读(177) 评论(0) 推荐(0)
POJ-2513 Colored Sticks 【欧拉通路+Trie】
摘要：Description You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a st 阅读全文
posted @ 2017-04-07 21:51 Robin! 阅读(148) 评论(0) 推荐(0)
POJ-1275 Cashier Employment 【差分约束+二分】
摘要：Description A supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired 阅读全文
posted @ 2017-04-07 18:05 Robin! 阅读(202) 评论(0) 推荐(0)
POJ-1364 King 【差分约束】
摘要：Description Once, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was 阅读全文
posted @ 2017-04-06 22:19 Robin! 阅读(200) 评论(0) 推荐(0)
线段树扫描线求矩形面积并
摘要：1.HDU-1542 Atlantis Problem Description There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these t 阅读全文
posted @ 2017-04-02 23:04 Robin! 阅读(377) 评论(0) 推荐(0)
POJ-1651 Multiplication Puzzle 【区间DP】
摘要：Description The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card 阅读全文
posted @ 2017-03-20 17:30 Robin! 阅读(320) 评论(0) 推荐(0)
POJ-3321 Apple Tree 【DFS序+树状数组】
摘要：Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has 阅读全文
posted @ 2017-03-12 21:57 Robin! 阅读(114) 评论(0) 推荐(0)
POJ-1741 Tree 【点分治】
摘要：Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and 阅读全文
posted @ 2017-03-11 23:08 Robin! 阅读(121) 评论(0) 推荐(0)
POJ-1195 Mobile phones 【树状数组+二维】
摘要：Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. Th 阅读全文
posted @ 2017-03-08 13:34 Robin! 阅读(154) 评论(0) 推荐(0)
POJ-2352 Stars【树状数组】
摘要：Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the leve 阅读全文
posted @ 2017-03-06 19:21 Robin! 阅读(103) 评论(0) 推荐(0)
POJ-2528 Mayor's posters 【线段树+离散化】
摘要：Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral poste 阅读全文
posted @ 2017-02-28 20:05 Robin! 阅读(121) 评论(0) 推荐(0)
POJ-2387 Til the Cows Come Home 【最短路+Dijkstra】
摘要：Description 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 阅读全文
posted @ 2017-02-27 19:01 Robin! 阅读(366) 评论(0) 推荐(0)
POJ-1661 Help Jimmy (DP)
摘要：Description "Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右 阅读全文
posted @ 2017-02-16 14:47 Robin! 阅读(178) 评论(0) 推荐(0)
POJ-2393 Yogurt factory (贪心）
摘要：题目： The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and lab 阅读全文
posted @ 2017-02-02 01:55 Robin! 阅读(165) 评论(0) 推荐(0)
POJ-3190 Stall Reservations (优先队列+贪心）
摘要：题目： Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 阅读全文
posted @ 2017-02-01 21:23 Robin! 阅读(160) 评论(0) 推荐(0)
POJ-3186 Treats for the Cows (区间DP）
摘要：Description FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day an 阅读全文
posted @ 2017-01-22 21:15 Robin! 阅读(127) 评论(0) 推荐(0)