![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
文章平均质量分 75
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
poj 1159 && hdu 1513 Palindrome(LCS)
DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines t原创 2016-04-25 23:21:27 · 342 阅读 · 0 评论 -
poj 3186 Treats for the Cows(区间dp)
DescriptionFJ has purchased N (1 The treats are interesting for many reasons:The treats are numbered 1..N and stored sequentially in single file in a long box that is open at both ends. On原创 2016-04-23 09:25:22 · 328 阅读 · 0 评论 -
poj 2411&&hdu 1400 Mondriaan's Dream(状压DP)
Problem DescriptionSquares and rectangles fascinated the famous Dutch painter PietMondriaan. One night, after producing the drawings in his 'toilet series'(where he had to use his toilet paper to原创 2015-12-19 21:47:22 · 415 阅读 · 0 评论 -
hdu 1054 &&poj 1463 Strategic Game(树形dp)
Strategic Game时间限制1秒 内存限制10240KBProblem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sa原创 2015-12-23 16:52:02 · 515 阅读 · 0 评论 -
hdu 2602 Bone Collector(01背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42947 Accepted Submission(s): 17894Problem DescriptionMany原创 2015-12-24 16:34:54 · 225 阅读 · 0 评论 -
codeforces 629C Famil Door and Brackets(dp)
As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a string consisted of round brackets since Famil Door loves string of原创 2016-02-26 19:26:42 · 2003 阅读 · 0 评论 -
poj 2127 Greatest Common Increasing Subsequence(最长公共上升子序列dp)
DescriptionYou are given two sequences of integer numbers. Write a program to determine their common increasing subsequence of maximal possible length. Sequence S1 , S2 , . . . , SN of length N原创 2016-03-01 23:51:36 · 351 阅读 · 0 评论 -
hdu 1423 Greatest Common Increasing Subsequence(最长公共上升子序列dp)
Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is described with M - its length (1原创 2016-03-01 23:53:27 · 286 阅读 · 0 评论 -
hdu 5115 Dire Wolf(区间dp)
Problem DescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor.Dire wolves look like norma原创 2016-03-06 13:50:01 · 335 阅读 · 0 评论 -
codeforces 607 B Zuma(区间dp)
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as原创 2016-03-10 22:06:46 · 533 阅读 · 0 评论 -
hdu 1501 Zipper(dfs或dp)
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra原创 2016-03-28 17:05:59 · 423 阅读 · 0 评论 -
hdu 5410 CRB and His Birthday(01+多重背包 dp)
CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1188 Accepted Submission(s): 591Problem DescriptionToday原创 2016-05-02 14:41:07 · 2843 阅读 · 0 评论 -
hdu 5656 CA Loves GCD(穷举子集类dp)
Problem DescriptionCA is a fine comrade who loves the party and people; inevitably she loves GCD (greatest common divisor) too. Now, there are N different numbers. Each time, CA will select se原创 2016-04-10 20:15:51 · 488 阅读 · 0 评论 -
hdu 5119 Happy Matt Friends(穷举子集类dp)
Problem DescriptionMatt has N friends. They are playing a game together.Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (ex原创 2016-04-25 23:32:59 · 3316 阅读 · 0 评论 -
hdu 1159 && POJ 1458Common Subsequence(LCS)
Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e原创 2016-04-25 23:24:47 · 320 阅读 · 0 评论 -
hdu 5317 RGCDQ(dp)
RGCDQTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2618 Accepted Submission(s): 1040Problem DescriptionMr. Hdu is intereste原创 2016-06-10 19:12:23 · 496 阅读 · 0 评论