POJ
文章平均质量分 82
hyj542682306
平凡之路
展开
-
【最小生成树】POJ 2395 Out of Hay
DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (原创 2017-04-24 09:27:31 · 274 阅读 · 0 评论 -
【01背包】POJ 3624 Charm Bracelet
DescriptionBessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from theN (1 ≤ N ≤ 3,402) available charms. Each charm原创 2017-04-24 09:26:08 · 463 阅读 · 0 评论 -
【并查集】POJ 2492 A Bug's Life
DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opp原创 2017-04-24 09:24:54 · 279 阅读 · 0 评论 -
【并查集】POJ 1611 The Suspects
DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strate原创 2017-04-24 09:23:20 · 272 阅读 · 0 评论 -
【DP】POJ 1088 滑雪
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11原创 2017-04-24 09:21:40 · 288 阅读 · 0 评论 -
【最小生成树】POJ 2421 Constructing Roads
DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and原创 2017-04-24 09:14:46 · 222 阅读 · 0 评论 -
【最小生成树】POJ 2349 Arctic Network
DescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the networ原创 2017-04-24 09:09:04 · 210 阅读 · 0 评论 -
【递推】POJ 1664 放苹果
Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。Output对输入的每组数据M和N,用一行输出相应的K。Sample Input1 7 3Sample Output原创 2017-04-24 09:17:38 · 310 阅读 · 0 评论 -
【最小生成树】POJ 1287 Networking
DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect原创 2017-04-24 09:28:45 · 406 阅读 · 0 评论