随笔分类 -  HDU

HDU5092——Seam Carving(动态规划+回溯)(2014上海邀请赛重现)
摘要：Seam CarvingDescriptionFish likes to take photo with his friends. Several days ago, he found that some pictures of him were damaged. The trouble is th... 阅读全文
posted @ 2014-11-05 17:48 Enumz 阅读(709) 评论(0) 推荐(0)
HDU5093——Battle ships(最大二分匹配)(2014上海邀请赛重现)
摘要：Battle shipsProblem DescriptionDear contestant, now you are an excellent navy commander, who is responsible of a tough mission currently.Your fleet un... 阅读全文
posted @ 2014-11-04 02:20 Enumz 阅读(255) 评论(0) 推荐(0)
HDU5088——Revenge of Nim II(高斯消元&矩阵的秩)(BestCoder Round #16)
摘要：Revenge of Nim IIProblem DescriptionNim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On ea... 阅读全文
posted @ 2014-11-03 23:32 Enumz 阅读(235) 评论(0) 推荐(0)
HDU5099——Comparison of Android versions(简单题)(2014上海邀请赛重现)
摘要：Comparison of Android versionsProblem DescriptionAs an Android developer, itˇs really not easy to figure out a newer version of two kernels, because A... 阅读全文
posted @ 2014-11-03 17:08 Enumz 阅读(359) 评论(0) 推荐(0)
HDU5090——Game with Pearls(匈牙利算法|贪心)(2014上海邀请赛重现)
摘要：Game with PearlsProblem DescriptionTom and Jerry are playing a game with tubes and pearls. The rule of the game is:1) Tom and Jerry come up together w... 阅读全文
posted @ 2014-11-03 17:00 Enumz 阅读(743) 评论(0) 推荐(1)
HDU5087——Revenge of LIS II(BestCoder Round #16)
摘要：Revenge of LIS IIProblem DescriptionIn computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in wh... 阅读全文
posted @ 2014-11-02 11:30 Enumz 阅读(190) 评论(0) 推荐(0)
HDU5086——Revenge of Segment Tree(BestCoder Round #16)
摘要：Revenge of Segment TreeProblem DescriptionIn computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows q... 阅读全文
posted @ 2014-11-02 11:22 Enumz 阅读(183) 评论(0) 推荐(0)
HDU4908——BestCoder Sequence(BestCoder Round #3)
摘要：BestCoder SequenceProblem DescriptionMr Potato is a coder.Mr Potato is the BestCoder.One night, an amazing sequence appeared in his dream. Length of t... 阅读全文
posted @ 2014-08-04 10:44 Enumz 阅读(531) 评论(6) 推荐(2)
HDU4907——Task schedule(BestCoder Round #3)
摘要：Task scheduleDescription有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。有m个询问，每个询问有一个数字q，表示如果在q时间有一个工作表之外的任务请求，请计算何时这个任务才能被执行。机器总是按照工作表执行，当机器空闲... 阅读全文
posted @ 2014-08-04 10:29 Enumz 阅读(233) 评论(0) 推荐(1)
HDU1171——Big Event in HDU(母函数)
摘要：Big Event in HDUDescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer Colle... 阅读全文
posted @ 2014-07-30 16:30 Enumz 阅读(206) 评论(0) 推荐(1)
HDU4857——逃生(反向建图+拓扑排序)(BestCoder Round #1)
摘要：逃生Description糟糕的事情发生啦，现在大家都忙着逃命。但是逃命的通道很窄，大家只能排成一行。现在有n个人，从1标号到n。同时有一些奇怪的约束条件，每个都形如：a必须在b之前。同时，社会是不平等的，这些人有的穷有的富。1号最富，2号第二富，以此类推。有钱人就贿赂负责人，所以他们有一些好处。负... 阅读全文
posted @ 2014-07-27 17:54 Enumz 阅读(262) 评论(0) 推荐(0)
HDU1535——Invitation Cards(最短路径：SPAF算法+dijkstra算法)
摘要：Invitation CardsDescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this f... 阅读全文
posted @ 2014-07-22 16:48 Enumz 阅读(720) 评论(1) 推荐(0)
HDU1548——A strange lift(最短路径：dijkstra算法)
摘要：A strange liftDescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 2 #include 3 #include 4... 阅读全文
posted @ 2014-07-22 15:51 Enumz 阅读(342) 评论(0) 推荐(0)
HDU1875——畅通工程再续(最小生成树：Kruskal算法)
摘要：畅通工程再续Description相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRush对百岛湖的情况充分了解后，决定在符合... 阅读全文
posted @ 2014-07-19 17:11 Enumz 阅读(640) 评论(2) 推荐(1)
HDU1312——Red and Black(DFS)
摘要：Red and BlackProblem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on... 阅读全文
posted @ 2014-07-13 10:27 Enumz 阅读(336) 评论(0) 推荐(0)