【动态规划】
文章平均质量分 89
zthgreat
这个人很懒,什么都没有留下
展开
-
杭电2084 数塔
菜鸟正在研究算法啦,这个是原创 2014-05-17 11:54:45 · 699 阅读 · 0 评论 -
poj 2250 Compromise(LCS)
CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7346 Accepted: 3235 Special JudgeDescriptionIn a few months the European Currency Union原创 2015-11-12 22:26:23 · 883 阅读 · 0 评论 -
hdu 1513 Palindrome(dp 回文子序列)
PalindromeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4284 Accepted Submission(s): 1467Problem DescriptionA palindrome is原创 2015-10-28 12:14:47 · 457 阅读 · 0 评论 -
poj 2533 Longest Ordered Subsequence(最长上升子序列)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33657 Accepted: 14730DescriptionA numeric sequence of ai is ordered if a1 a原创 2014-09-01 21:19:44 · 394 阅读 · 0 评论 -
poj 3628 Bookshelf 2(01背包,dfs)
DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ has N cows (1 ≤原创 2014-12-04 19:48:52 · 550 阅读 · 0 评论 -
hdu 2602 Bone Collector(01背包)
Problem 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 as dog’s , cow’s , also he went to the grav原创 2014-12-04 16:51:30 · 356 阅读 · 0 评论 -
poj 3624 Charm Bracelet(01背包)
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24394 Accepted: 11007DescriptionBessie has gone to the mall's jewelry store and spies a原创 2014-12-04 16:29:36 · 541 阅读 · 0 评论 -
hdu 2546 饭卡(01背包)
饭卡Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少原创 2015-10-28 21:09:31 · 446 阅读 · 0 评论 -
hdu 4283 You Are the One(区间dp)
You Are the OneProblem Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is原创 2015-11-15 17:17:27 · 409 阅读 · 0 评论 -
hdu 2639 Bone Collector II(01背包 第K优解)
Bone Collector IIProblem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't se原创 2015-10-29 16:48:35 · 574 阅读 · 0 评论 -
hdu 2955 Robberies(01背包)
RobberiesProblem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy.原创 2015-10-29 17:30:43 · 684 阅读 · 0 评论 -
Codeforces Round 580 D. Kefa and Dishes (状态压缩dp)
D. Kefa and Dishestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Kefa came to the restaurant and sat原创 2015-11-15 15:18:56 · 728 阅读 · 0 评论 -
hdu 4512 吉哥系列故事——完美队形I(LICS)
吉哥系列故事——完美队形IProblem Description 吉哥这几天对队形比较感兴趣。 有一天,有n个人按顺序站在他的面前,他们的身高分别是h[1], h[2] ... h[n],吉哥希望从中挑出一些人,让这些人形成一个新的队形,新的队形若满足以下三点要求,则称之为完美队形: 1、挑出的人保持他们在原队形的相对顺序不变; 2、左右对称,假原创 2015-11-22 22:02:44 · 497 阅读 · 0 评论 -
hdu 1423 Greatest Common Increasing Subsequence(最长公共递增子序列LICS)
Greatest Common Increasing SubsequenceProblem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequenc原创 2015-11-10 16:57:12 · 558 阅读 · 0 评论 -
poj 3254 Corn Fields(状态压缩dp)
Corn FieldsDescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on原创 2015-11-24 12:32:30 · 1105 阅读 · 0 评论 -
poj 2955 Brackets(区间dp)
BracketsDescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, th原创 2015-11-23 17:29:03 · 597 阅读 · 0 评论 -
poj 2411 Mondriaan's Dream(状态压缩dp)
Mondriaan's DreamDescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use h原创 2015-11-24 17:27:53 · 4694 阅读 · 0 评论 -
hdu 4745 Two Rabbits(dp最长回文子序列)
Two RabbitsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1227 Accepted Submission(s): 617Problem DescriptionLong long ago,原创 2015-10-27 17:22:04 · 627 阅读 · 0 评论 -
hdu1503 Advanced Fruits(DP 最长公共子序列变形)
Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2201 Accepted Submission(s): 1123Special JudgeProblem Description原创 2015-10-25 17:42:27 · 583 阅读 · 0 评论 -
hdu 1257 最少拦截系统(贪心,dp)
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18008 Accepted Submission(s): 7091Problem Description某国为了防御敌国的导弹袭击,发展出一原创 2014-07-30 15:00:45 · 570 阅读 · 0 评论 -
最长上升子序列
一个数的序列bi,当b1 2 < ... <bS的时候,我们称这个序列是上升的。对于给定的一个序列(a1, a2, ...,aN),我们可以得到一些上升的子序列(ai1, ai2, ...,aiK),这里1 iK 。比如,对于序列(1, 7, 3, 5, 9, 4, 8),有它的一些上升子序列,如(1, 7), (3, 4, 8)等等。这些子序列中最长的长度是4原创 2014-05-17 14:54:42 · 540 阅读 · 0 评论 -
zoj 1025 Wooden Sticks
Wooden SticksTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by原创 2014-08-02 15:46:32 · 536 阅读 · 0 评论 -
hdu 1231 最大连续子序列
http://acm.hdu.edu.cn/showproblem.php?pid=1231原创 2014-05-17 12:30:24 · 537 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22532 Accepted Submission(s): 9916Problem Descrip原创 2014-09-01 20:25:03 · 370 阅读 · 0 评论 -
hdu 1003 Max Sum
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 146250 Accepted Submission(s): 34156Problem DescriptionGiven a sequenc原创 2014-09-01 14:21:19 · 431 阅读 · 0 评论 -
poj1745 Divisibility
DescriptionConsider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different原创 2014-12-07 21:32:30 · 465 阅读 · 0 评论 -
poj 1837 Balance
DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm's lengt原创 2014-12-07 23:22:27 · 469 阅读 · 0 评论 -
CodeForces 518 D. Ilya and Escalator(概率DP)
Ilya got tired of sports programming, left university and got a job in the subway. He was given the task to determine the escalator load factor. Let's assume that n people stand in the queue for t原创 2015-03-28 13:02:30 · 676 阅读 · 0 评论 -
hdu 2660 Accepted Necklace(dfs、dp)
Problem DescriptionI have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each原创 2015-01-21 19:30:44 · 516 阅读 · 0 评论 -
hdu 2512 一卡通大冒险(dp)
Problem Description因为长期钻研算法, 无暇顾及个人问题,BUAA ACM/ICPC 训练小组的帅哥们大部分都是单身。某天,他们在机房商量一个绝妙的计划"一卡通大冒险"。这个计划是由wf最先提出来的,计划的内容是,把自己的联系方式写在校园一卡通的背面,然后故意将自己的卡"遗失"在某处(如水房,TD,食堂,主M。。。。)他们希望能有MM看到他们遗失卡,能主动跟他们联系,这样原创 2015-01-20 18:24:12 · 715 阅读 · 0 评论 -
hdu 5280 Senior's Array(dp)
Problem DescriptionOne day, Xuejiejie gets an array A. Among all non-empty intervals of A, she wants to find the most beautiful one. She defines the beauty as the sum of the interval. The beau原创 2015-07-14 20:53:54 · 935 阅读 · 0 评论 -
hdu 1159 Common Subsequence(最长公共子序列)
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23761 Accepted Submission(s): 10490Problem DescriptionA sub原创 2014-09-01 23:09:56 · 543 阅读 · 0 评论 -
CodeForces 431C k-Tree(dp)
Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree.A k-tree is an infinite rooted tr原创 2015-05-14 16:00:36 · 1088 阅读 · 0 评论 -
hiho一下 微软笔试题《String Matching Content Length》
时间限制:10000ms单点时限:1000ms内存限制:256MB描述We define the matching contents in the strings of strA and strB as common substrings of the two strings. There are two additional restrictions on原创 2015-08-25 17:17:15 · 1374 阅读 · 1 评论 -
hdu 1176免费馅饼(二维dp)
Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中原创 2015-08-01 21:56:52 · 427 阅读 · 0 评论 -
hdu 1864 最大报销额(01背包)
最大报销额Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。原创 2015-11-04 21:15:33 · 493 阅读 · 0 评论 -
hdu 1284 钱币兑换问题
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5503 Accepted Submission(s): 3151Problem Description在一个国家仅有1分,2分,3分硬币,将原创 2014-08-03 17:06:01 · 515 阅读 · 0 评论