动态规划
文章平均质量分 79
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
HDU 5389 Zero Escape
题意:给出A, B两个值, 再给出n个数,问n个数分成2组,使其中一组的数字根为A,另一组数字根为B,或者所有数的数字根为A或B的方法有多少种。 数字根题目有说,还可以直接把数加起来然后模9得到。思路:dp[i][j]表示前i个数中,组成的数字根值为j的方法有多少种 状态转移:dp[i][j] = (dp[i][j] + dp[i - 1][原创 2015-08-19 21:37:14 · 336 阅读 · 0 评论 -
HDU4003 Find Metal Mineral(树形DP+分组背包)
Find Metal MineralTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3163 Accepted Submission(s): 1460Problem DescriptionHumans ha原创 2016-03-31 19:47:03 · 560 阅读 · 0 评论 -
HDU1561 The more, The Better(树形dp)
The more, The BetterTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6915 Accepted Submission(s): 4054Problem DescriptionACboy很喜原创 2016-03-24 20:53:21 · 424 阅读 · 0 评论 -
HDU1011 Starship Troopers(树形dp)
Starship TroopersTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15816 Accepted Submission(s): 4231Problem DescriptionYou, the原创 2016-03-24 21:04:28 · 367 阅读 · 0 评论 -
HDU1520 Anniversary party(树形dp)
Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8046 Accepted Submission(s): 3507Problem DescriptionThere is g原创 2016-03-26 15:48:13 · 408 阅读 · 0 评论 -
HDU1074 Doing Homework(状态压缩DP)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7618 Accepted Submission(s): 3425Problem DescriptionIgnatius ha原创 2016-05-19 17:27:44 · 344 阅读 · 0 评论 -
整数划分
题目:1.将整数n划分成若干整数的划分数2.将整数n划分成k个整数的划分数3.将整数n划分成若干不同整数的划分数4.将整数n划分成若干奇正整数的划分数思路1.将整数n划分成若干整数的划分数dp[i][j]表示将整数i划分成不大于j的整数的划分数。当i==j时,当划分中含有j就只有一种情况,否则就等价于将i划分成不大于j-1的划分数dp[i][j-1],所以d原创 2016-07-22 20:32:20 · 320 阅读 · 0 评论 -
poj2192 Zipper(dp)
ZipperTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17961Accepted: 6391DescriptionGiven three strings, you are to determine w原创 2016-07-25 23:12:05 · 353 阅读 · 0 评论 -
数组分割
有n件物品,第i件物品重wi,现在将n件物品分成2堆,要求2堆的物品数量不超过1,并且使得2堆物品的重量相差最小,最后输出两对物品的重量。这题和编程之美的2.18数组分割差不多。从n件物品中选n/2间放到一堆,使得另一堆和它物品数量差不超过1而且重量相差最小,这里是一定要选n/2件组成一堆。原来认为是:for(i =1.....n) for(j=n/2原创 2016-07-19 21:01:43 · 365 阅读 · 0 评论 -
hdu5534 Partial Tree
Partial TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 599 Accepted Submission(s): 294Problem DescriptionIn mathematics, a原创 2016-02-19 16:37:15 · 379 阅读 · 0 评论 -
HDU2196 Computer(树形DP)
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5106 Accepted Submission(s): 2577Problem DescriptionA school bought the原创 2016-03-27 11:38:49 · 373 阅读 · 0 评论 -
HDU3452 Bonsai(树形DP)
BonsaiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 877 Accepted Submission(s): 435Problem DescriptionAfter being assaulted i原创 2016-03-29 22:02:04 · 475 阅读 · 0 评论 -
HUD 5375 Gray code 动态规划
当i这个位置填0时能获取的最大值原创 2015-08-17 22:26:23 · 398 阅读 · 0 评论 -
HDU 5045 Contest DP+状态压缩
ContestTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 6Font: Times New Roman | Verdana | GeorgiaFont原创 2015-09-08 16:16:27 · 419 阅读 · 0 评论 -
vijos P1059积木城堡
把最小的城堡的值记录下来,然后每一个城堡都当作一个01背包,每个城堡只能放进自己的积木,求出都能达到的最大高度, 177ms#include #include struct node{ int L[105], len;}a[105];int dp[105][10005];int max(int a, int b){ return a>b?a:b;}int main(){原创 2015-09-12 14:52:38 · 795 阅读 · 0 评论 -
vijos P1071新年趣事之打牌
01背包,网上看了好些记录方法都不太喜,自己就写了个#include #include int dp[100005], a[105], vis[100005], put[105];int main(){ int n, i, j, v, sum, flag, tp, ok; scanf("%d %d", &v, &n); sum = 0; for(i = 0;i < n;i++)原创 2015-09-12 14:48:16 · 812 阅读 · 0 评论 -
POJ 1088 滑雪
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 86432 Accepted: 32326DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等原创 2015-12-23 01:23:57 · 382 阅读 · 0 评论 -
Codeforces Round #336 (Div. 2) C. Chain Reaction
C. Chain Reactiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n beacons located at distinct positions on a number原创 2015-12-26 17:30:26 · 483 阅读 · 0 评论 -
Good Bye 2015 C. New Year and Domino dp+容斥原理
C. New Year and Dominotime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThey say "years are like dominoes, tumbling one after the原创 2016-02-02 10:04:44 · 424 阅读 · 0 评论 -
HDU3182 Hamburger Magi(状态压缩)
Hamburger MagiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 462 Accepted Submission(s): 146Problem DescriptionIn the myster原创 2016-03-05 10:32:08 · 406 阅读 · 0 评论 -
HDU5965 扫雷(递推)
扫雷 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 999 Accepted Submission(s): 290Problem Description扫雷游戏是晨晨和小璐特别喜欢的智力游戏,她俩最近沉迷原创 2016-11-19 11:02:54 · 486 阅读 · 0 评论