dp
catTom
这个作者很懒,什么都没留下…
展开
-
hdu3538
A sample Hamilton pathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 306 Accepted Submission(s): 142Problem DescriptionGive原创 2013-04-01 18:45:48 · 908 阅读 · 1 评论 -
hiho1486 物品价值
描述小Hi现在有n个物品,每个物品都有一个价值。并且这n个物品总共有m个不同的属性,每个物品都具有其中若干属性。小Ho要从中选出若干物品,满足每个属性都正好有奇数个物品拥有,且被选出的物品价值总和最大。你能帮助小Ho完成任务么?输入第一行一个数T(第一行两个数n,m(1接下来每两行描述一件物品。对于每一件物品:第一行两个数v和s,表示原创 2017-03-26 15:57:05 · 1300 阅读 · 0 评论 -
hiho 1469 福字
#1469 : 福字时间限制:6000ms单点时限:1000ms内存限制:256MB描述新年到了,你收到了一副画。你想找到里面最大的福字。一副画是一个n × n的矩阵,其中每个位置都是一个非负整数。一个福字被定义成是大小为 k 的正方形,满足其中的每个位置上的数都恰好比他的左边的那个和上边的那个大1(如果左边或上边的那个不存在的话原创 2017-02-21 13:20:04 · 424 阅读 · 0 评论 -
Facebook Hacker Cup 2017 Round 1 Pie Progress
In the ever-popular role-playing game Dungeons & Dragons, or D&D, some wizards enhance their skills by training as geometers, specialist spell-casters who rely on th原创 2017-01-28 18:05:51 · 1167 阅读 · 0 评论 -
Facebook Hacker Cup 2016 Qualification Round Text Editor
Facebook Hacker Cup 2016 Qualification RoundYou have a list of N distinct words, consisting of only lowercase letters. You'd like to print any K words from this list, one per page, in any or原创 2017-01-27 20:20:41 · 342 阅读 · 0 评论 -
hdu3033(分组背包二次dp处理)
I love sneakers!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2895 Accepted Submission(s): 1185Problem DescriptionAfter mon原创 2013-07-09 20:25:16 · 793 阅读 · 0 评论 -
hdu3001(集合dp求哈密顿回路)
TravellingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2460 Accepted Submission(s): 707Problem DescriptionAfter coding so原创 2013-07-06 19:37:35 · 916 阅读 · 0 评论 -
hdu1227
Fast FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1514 Accepted Submission(s): 658Problem DescriptionThe fastfood chain Mc原创 2013-04-04 23:57:41 · 635 阅读 · 0 评论 -
poj 1088滑雪
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61436 Accepted: 22430DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二原创 2012-10-06 12:31:47 · 649 阅读 · 0 评论 -
hdu1081
To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5749 Accepted Submission(s): 2715Problem DescriptionGiven a two-dim原创 2013-04-01 20:21:04 · 689 阅读 · 0 评论 -
hdu1003
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 98850 Accepted Submission(s): 22737Problem DescriptionGiven a sequence原创 2013-03-23 23:38:30 · 823 阅读 · 2 评论 -
Kickstart Round G 2017 Problem C. Matrix Cutting
Problem C. Matrix CuttingThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start原创 2017-10-22 21:29:48 · 328 阅读 · 0 评论