随笔分类 -  HDU报告

上一页 1 2
最长上升子序列变形题-二分查找DP
摘要：Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13752Accepted Submission(s): 3920Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文
posted @ 2014-02-16 13:00 偶尔会寂寞 阅读(418) 评论(0) 推荐(0)
最少拦截系统-筛选法
摘要：最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14849Accepted Submission(s): 5905Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几 阅读全文
posted @ 2014-02-16 10:09 偶尔会寂寞 阅读(145) 评论(0) 推荐(0)
HDU1114(完全背包问题)
摘要：Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9526 Accepted Submission(s): 4803Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action... 阅读全文
posted @ 2014-02-15 22:15 偶尔会寂寞 阅读(1603) 评论(0) 推荐(1)
HDU1159最长公共子序列
摘要：Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20061Accepted Submission(s): 8571Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another. 阅读全文
posted @ 2014-02-15 20:37 偶尔会寂寞 阅读(150) 评论(0) 推荐(0)
HDU2048（递推错排）
摘要：神、上帝以及老天爷Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19549Accepted Submission(s): 8287Problem DescriptionHDU 2006'10 ACM contest的颁奖晚会隆重开始了！为了活跃气氛，组织者举行了一个别开生面、奖品丰厚的抽奖活动，这个活动的具体要求是这样的：首先，所有参加晚会的人员都将一张写有自己名字的字条放入抽奖箱中；然后，待所有字条加入完毕，每人从箱中取一个字条；最 阅读全文
posted @ 2014-02-15 17:34 偶尔会寂寞 阅读(315) 评论(2) 推荐(0)
HDU2602(01背包)
摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23977Accepted Submission(s): 9729Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such 阅读全文
posted @ 2014-02-15 15:01 偶尔会寂寞 阅读(169) 评论(0) 推荐(0)
4540
摘要：威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1141 Accepted Submission(s): 600Problem Description 威威猫最近不务正业，每天沉迷于游戏“打地鼠”。 每当朋友们劝他别太着迷游戏，应该好好工作的时候，他总是说，我是威威猫，猫打老鼠就是我的工作！ 无话可说... 我们知道，打地鼠是一款经典小游戏，规则很简单：每隔一个时间段就会从地下冒出一只或多只地鼠，玩... 阅读全文
posted @ 2014-02-14 19:50 偶尔会寂寞 阅读(425) 评论(0) 推荐(0)
1176（动规）
摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21666 Accepted Submission(s): 7309Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能... 阅读全文
posted @ 2014-02-14 18:36 偶尔会寂寞 阅读(286) 评论(0) 推荐(0)
HDU1465（递推-错排公式）
摘要：不容易系列之一Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12886 Accepted Submission(s): 5389Problem Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告诉大家，要想失败到一定程度也是不容易的。比如，我高中的时候，就有一个神奇的... 阅读全文
posted @ 2014-02-14 16:12 偶尔会寂寞 阅读(243) 评论(1) 推荐(0)
HDU2045(递推题)
摘要：不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26368Accepted Submission(s): 10507Problem Description人称“AC女之杀手”的超级偶像LELE最近忽然玩起了深沉，这可急坏了众多“Cole”（LELE的粉丝,即"可乐"）,经过多方打探，某资深Cole终于知道了原因，原来，LELE最近研究起了著名的RPG难题:有排成一行的ｎ个方格，用红 阅读全文
posted @ 2014-02-14 15:44 偶尔会寂寞 阅读(381) 评论(1) 推荐(0)
HDU1205
摘要：吃糖果Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 20378 Accepted Submission(s): 5861Problem DescriptionHOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。 Input... 阅读全文
posted @ 2014-02-14 13:20 偶尔会寂寞 阅读(467) 评论(0) 推荐(0)
HDU-1005（规律题）
摘要：Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 92129Accepted Submission(s): 21967Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to 阅读全文
posted @ 2014-02-14 11:17 偶尔会寂寞 阅读(121) 评论(0) 推荐(0)
HDU1518 Square
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1518算法参考：http://blog.csdn.net/w00w12l/article/details/7865348Problem DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square?InputThe first line of input contains N, the number of test cases. Each test cas 阅读全文
posted @ 2014-02-12 15:27 偶尔会寂寞 阅读(105) 评论(0) 推荐(0)
A + B Problem II
摘要：A + B Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 177301Accepted Submission(s): 33930Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of 阅读全文
posted @ 2013-11-17 09:44 偶尔会寂寞 阅读(221) 评论(0) 推荐(0)
Let the Balloon Rise
摘要：Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 61357Accepted Submission(s): 22597Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time 阅读全文
posted @ 2013-11-16 19:24 偶尔会寂寞 阅读(237) 评论(0) 推荐(0)

上一页 1 2