2016年05月_Creed_Wu

原创 poj 3268 Bookshelf 2

/*Bookshelf 2Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9314 Accepted: 4215DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting

2016-05-22 19:23:58 344

原创 HDU 2639 Bone Collector II

/*Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't ma

2016-05-22 17:07:24 267

原创 poj 2184 Cow Exhibition

/*Description"Fat and docile, big and dumb, they look so stupid, they aren't much fun..." - Cows with Guns by Dana Lyons The cows want to prove to the public that they are both smart and fun. In

2016-05-22 17:04:49 274

原创 UVA 624(记录路径）

/*You have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is onCDs. You need to have it on tapes so the problem to solve is: you have a tape N minutes long. Ho

2016-05-22 17:01:44 272

原创 HDU 2546 饭卡

/*Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。 Inpu

2016-05-22 17:00:07 206

原创 HDU 1284 钱币兑换问题

/*Problem Description在一个国家仅有1分，2分，3分硬币，将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。 Input每行只有一个正整数N，N小于32768。 Output对应每个输入，输出兑换方法数。 Sample Input293412553 Sample Output71883113137761*/#include

2016-05-22 16:56:55 315

原创 HDU 2159 FATE（完全背包）

/*Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐度降到0或者0以下时，xhd就不会玩这游戏。xhd还说了他最

2016-05-22 16:54:57 288

原创 poj 2456 Aggressive cows

/*DescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000). His C (2 <= C

2016-05-05 21:44:54 353

这几天做了题才知道，二分法不止可以用于查找二分搜索法，是通过不断缩小解可能存在的范围，从而求得问题的最优解的方法，这个算法在求最优解的问题上非常有用。让我们考虑一下，“求满足某个条件C(x)的最小的x"这一问题。对于任意满足C(x)的x，如果所有的x'>=x也满足C(x')的话，我们就可以用二分搜索来求得最小的x。首先我们将区间的左端点初始化为不满足C(x)的值，右端点初始化为满足C(x)的值。然

2016-05-05 21:35:21 234

zhulingyan1018的博客