随笔分类 -  贪心

C. Counting Kangaroos is Fun 贪心
摘要:C. Counting Kangaroos is Funtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere arenkangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who h 阅读全文

posted @ 2013-12-15 16:40 keep trying 阅读(439) 评论(0) 推荐(0)

G - Jeff and Furik 逆序对 + 贪心
摘要:G -Jeff and FurikTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionJeff has become friends with Furik. Now these two are going to play one quite amusing game.At the beginning of the game Jeff takes a piece of paper and writes down a per 阅读全文

posted @ 2013-11-30 19:28 keep trying 阅读(459) 评论(0) 推荐(0)

C. Sereja and Algorithm 贪心
摘要:C. Sereja and Algorithmtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja loves all sorts of algorithms. He has recently come up with a new algorithm, which receives a string as an input. Let's represent the input string of the algorithm a 阅读全文

posted @ 2013-11-27 12:30 keep trying 阅读(306) 评论(0) 推荐(0)

K - Building designing 其实是贪心
摘要:K -Building designingTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionBuilding designingAn architect wants to design a very high building. The building will consist of some floors, and each floor has a certain size. The size of a floor must be greater than the s 阅读全文

posted @ 2013-11-21 21:06 keep trying 阅读(288) 评论(0) 推荐(0)

C. Fixing Typos 贪心
摘要:C. Fixing Typostime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMany modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.In this problem your task to implement a small function 阅读全文

posted @ 2013-11-11 21:21 keep trying 阅读(304) 评论(0) 推荐(0)

10026 - Shoemaker's Problem 贪心
摘要:Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ithjob, it is known the integer Ti(1#include#include#include#include#include#include#include#include#include#include#include//ios_base::sync_with_stdio(fal 阅读全文

posted @ 2013-10-21 22:57 keep trying 阅读(258) 评论(0) 推荐(0)

郑厂长系列故事——逃离迷宫 HDU4524
摘要:郑厂长系列故事——逃离迷宫Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1062Accepted Submission(s): 546Problem Description 郑厂长没变 还是那个假厂长真码农 改变的是业余爱好 他现在不研究象棋,改玩游戏了! 最近,郑厂长爱上了逃离迷宫这个游戏,他日日夜夜的玩,就是想达到自己的目标:1000万,因为这个数字和他在腾讯的年收入一样多。 不过,在他跑到9999999时,游戏屏幕上突然... 阅读全文

posted @ 2013-10-08 13:06 keep trying 阅读(292) 评论(0) 推荐(0)

导航