动态规划
文章平均质量分 79
Kefault
这个作者很懒,什么都没留下…
展开
-
poj 1836 Alignment
DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the原创 2013-09-20 19:26:51 · 894 阅读 · 0 评论 -
hdu 1059 Dividing
Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the m原创 2013-08-24 11:25:54 · 944 阅读 · 0 评论 -
hdu 3339 In Action
Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.Nowadays,the crazy b原创 2013-10-03 11:56:40 · 1254 阅读 · 0 评论 -
hdu 4901 The Romantic Hero
The Romantic HeroTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1078 Accepted Submission(s): 450Problem DescriptionThere i原创 2014-08-03 12:50:04 · 1048 阅读 · 0 评论 -
hdu 2089 不要62
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18707 Accepted Submission(s): 6294Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:原创 2014-07-30 18:26:29 · 776 阅读 · 0 评论 -
bnu 34985 Elegant String(矩阵快速幂+dp推导公式)
Elegant StringTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainPrev Submit Status Statistics Discuss NextType: None原创 2014-08-16 19:55:47 · 1367 阅读 · 0 评论 -
hdu 4960 Another OCD Patient
Another OCD PatientTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 87 Accepted Submission(s): 24Problem DescriptionXiaoji i原创 2014-08-19 18:37:15 · 1023 阅读 · 0 评论 -
hdu 5045 Contest(状态压缩DP)
题解:我们使用一个二位数组dp[i][j]记录进行到第i个任务时,人组合为j时的最大和(这里的j我们用二进制的每位对应一个人)。具体见代码:#include #include #include #include using namespace std;typedef long long ll;double s[11][1010];double dp[1010][105原创 2014-09-28 14:40:34 · 897 阅读 · 0 评论 -
acdream 1412 2-3 Trees
2-3 TreesTime Limit: 12000/6000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)SubmitStatusProblem Description 2-3 tree is an elegant data structure invented by John Ho原创 2014-10-03 11:44:59 · 1098 阅读 · 0 评论 -
zoj 3822 Domination
DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his fr原创 2014-10-13 21:02:28 · 1196 阅读 · 0 评论 -
hdu 5187-zhx's contest
题目及代码:大意就是给定一个数n,问使用数字1到n能组合出多少组同时满足下列两种情况的序列: 1.序列中的数字从第一项到第i项(1≤i≤n),满足单调递增或者递减; 2.序列中的数字从第i项到第n项满足单调递增或者递减; 官方题解给的是2^n-2(n≥2),n=1时为1。推到方法不明......原创 2015-03-16 16:43:55 · 746 阅读 · 0 评论 -
hdu 3466 Proud Merchants
Problem Description Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still转载 2013-08-22 16:07:36 · 860 阅读 · 0 评论 -
hdu 1114 Piggy-Bank
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The原创 2013-08-23 20:09:37 · 857 阅读 · 0 评论 -
hdu 4502 吉哥系列故事——临时工计划
Problem Description 俗话说一分钱难倒英雄汉,高中几年下来,吉哥已经深深明白了这个道理,因此,新年开始存储一年的个人资金已经成了习惯,不过自从大学之后他不好意思再向大人要压岁钱了,只能把唯一的希望放到自己身上。可是由于时间段的特殊性和自己能力的因素,只能找到些零零碎碎的工作,吉哥想知道怎么安排自己的假期才能获得最多的工资。 已知吉哥一共有m天的假期,每天的编号从1原创 2013-09-21 19:09:23 · 1257 阅读 · 0 评论 -
hdu 2571 命运
Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了!可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑!可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧!命运大迷宫可以看成是一个两维的方格阵列,如原创 2013-10-14 20:13:39 · 864 阅读 · 0 评论 -
hdu 1176 免费馅饼
Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个原创 2013-10-14 20:15:21 · 898 阅读 · 0 评论 -
codeforces 214E-Relay Race
DescriptionFurik and Rubik take part in a relay race. The race will be set up on a large square with the side of n meters. The given square is split inton × n cells (represented as unit squares)原创 2014-03-13 19:50:26 · 953 阅读 · 0 评论 -
POJ2385 Apple Catching
题目:题目的意思是说原创 2014-04-30 14:46:05 · 660 阅读 · 0 评论 -
hdu 1160 FatMouse's Speed
题目:寻找最长上升自序列。代码:#include #include #include #include using namespace std;struct node{ int w,s; //重量,速度 int num; //编号 int t; //用来记录当前编号原创 2014-04-30 18:17:45 · 811 阅读 · 0 评论 -
nefu 642 monkey
题目:大意是说 有n个台子,编号1-n,开始时,有一只猴子站在编号1的台子上,猴子可以自由地蹦到两侧的台子上,每次i移动话费的时间是一秒,有个人每秒钟仍一个盘子到其中的一个台子上,问在猴子移动次数不超过t的情况下,猴子能接到的最多的盘子数。方法:一个dp的题目,原来看到过,还不会做,直到最近在做dp的题目,才解决了这个题目。 使用一个三维数组dp[i][j][k],i代原创 2014-05-01 20:14:19 · 818 阅读 · 0 评论 -
nefu 650 max num
题目:经典dp题目,求出最大相邻子序列的和。方法:给出两种方法,一种dp,一种直接暴力(数据量小的时候可以考虑)。代码1:#include #include using namespace std;int main(){ int n; int t=1; cin>>n; int s[100010]; while(t<=n) {原创 2014-05-02 14:24:08 · 918 阅读 · 0 评论 -
最大子序列和的求解(时间复杂度O(N))
#include #include using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { int a[1000],i; for(i=0;i<n;i++) scanf("%d",&a[i]);原创 2013-07-30 19:48:48 · 933 阅读 · 0 评论 -
hdu 4865 Peter's Hobby
Peter's HobbyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283 Accepted Submission(s): 128Problem DescriptionRecently, Pete原创 2014-07-23 18:26:58 · 1118 阅读 · 0 评论 -
hdu 5179-beautiful number
题目:给定一个区间的两个区间端点l和r,问在l和r之间有多少满足下列情况的数字---这个数字应该满足前一位是后一位的倍数。分析:这是一个经典的数位DP的题目,我们可以把区间求和转化成两个区间的减法,即S[1,r]-S[1,l-1]就是我们求得的答案。 那么问题就转化成了求1-n之间满足情况的数的个数,那么我们就要使用dp[i][j]求得数字长度为i,首数字为j的满足情况的数原创 2015-03-10 18:44:58 · 815 阅读 · 0 评论