linyuxilu的博客

喷水装置（二）时间限制：3000 ms  |  内存限制：65535 KB难度：4描述有一块草坪，横向长w,纵向长为h,在它的橫向中心线上不同位置处装有n(n<=10000)个点状的喷水装置，每个喷水装置i喷水的效果是让以它为中心半径为Ri的圆都被润湿。请在给出的喷水装置中选择尽量少的喷水装置，把整个草坪全部润湿。输入第一行输入一个正整数N表示共有n次测

DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar install

Description“今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&*%...” 确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。 作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级

DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in th

DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divide

InputInput consists of pairs of lines. The first line of a pair contains the first string and the second linecontains the second string. Each string is on a separate line and consists of at most 1,0

DescriptionBackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several histori

DescriptionIt's commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made of copper. They were both so eager to get it and the figh

Description在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？  Input输入包括多组数据。每组数据第一行是两个整数N、M（N输入保证至少存在1条商店到赛场的路线。

网络的可靠性时间限制：3000 ms  |  内存限制：65535 KB难度：3描述A公司是全球依靠的互联网解决方案提供商，也是2010年世博会的高级赞助商。它将提供先进的网络协作技术，展示其”智能+互联“的生活概念，同时为参观者提供高品质的个人体验和互动，以”信息通信，尽情城市梦想”为主题贯穿。借助奇幻的剧场大屏幕和特效，展现信息通信技术的应用前景，通过生

DescriptionDilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the wooden hollow dolls of different sizes of which the small

Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial CityWall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in

DescriptionAn integer interval [a,b], a Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.InputThe

DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side an

DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at l

Lotus and CharactersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 796    Accepted Submission(s): 294Problem DescriptionLotus

E - Nested DollsTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1677DescriptionDilworth is the world’s most prominent colle

B - WarTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2600Description      War is the reciprical and violent application o

A - 免费馅饼Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1176Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameb

Radar时间限制：1000 ms  |  内存限制：65535 KB难度：3描述Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in

Yougth的最大化时间限制：1000 ms  |  内存限制：65535 KB难度：4描述Yougth现在有n个物品的重量和价值分别是Wi和Vi，你能帮他从中选出k个物品使得单位重量的价值最大吗？输入有多组测试数据每组测试数据第一行有两个数n和k，接下来一行有n个数Wi和Vi。(1输出输出使得单位价值的最大值。（保留两位小数）样

B - Ride to SchoolTime Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMany graduate students of Peking University are living in Wa

C - PacketsTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA factory produces products packed in square packets of the same he

L - StripiesTime Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionOur chemical biologists have invented a new very useful form of li

H - Box of BricksTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionLittle Bob likes playing with his box of bricks. He puts the

F - Wooden SticksTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a pile of n wooden sticks. The length and weight of

选择不相交区间时间限制：1000 ms  |  内存限制：65535 KB难度：2描述  好吧。这道题的目的在于让大家认识贪心问题的三个区间经典问题：区间选点问题，区间覆盖问题，以及该题的选择不相交区间问题。有许多的贪心问题可以转化为这三类的问题。  那么，对于该问题。就是给一系列的区间，求最多的区间，要求区间个数最多，这些区间不相交，需要注意的是这

A - Radar InstallationTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAssume the coasting is an infinite straight line. Land i

G - Game PredictionTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSuppose there are M people, including you, playing a specia

N - The KingTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionOnce upon a time in a country far away lived a king and he had a b

M - 有名的球员Time Limit:2000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe whole family was excited by the news. Everyone knew grandpa had b

P - Yogurt factoryTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe cows have purchased a yogurt factory that makes world-fa

D - Pass-MurailleTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1230DescriptionIn modern day magic shows, passing throug

开心的小明时间限制：1000 ms  |  内存限制：65535 KB难度：4描述小明今天很开心，家里购置的新房就要领钥匙了，新房里有一间他自己专用的很宽敞的房间。更让他高兴的是，妈妈昨天对他说：“你的房间需要购买哪些物品，怎么布置，你说了算，只要不超过N 元钱就行”。今天一早小明就开始做预算，但是他想买的东西太多了，肯定会超过妈妈限定的N 元。于是，他把每件物品规

推桌子时间限制：1000 ms  |  内存限制：65535 KB难度：3描述The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 2

Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22346 Accepted: 6088DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual