dp(动态规划)
文章平均质量分 89
圣诞老人家
这个作者很懒,什么都没留下…
展开
-
Little Tiger vs. Deep Monkey
A crowd of little animals is visiting a mysterious laboratory �C The Deep Lab of SYSU.“Are you surprised by the STS (speech to speech) technology of Microsoft Research and the cat face recogniti原创 2017-04-09 16:16:33 · 902 阅读 · 0 评论 -
hdu1513 dp
Problem 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, dete原创 2017-09-29 16:11:29 · 309 阅读 · 0 评论 -
hdu 2577 dp
Problem DescriptionPirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she原创 2017-09-29 14:54:46 · 369 阅读 · 0 评论 -
hdu 2825 ac自动机+dp
Problem DescriptionLiyuan lives in a old apartment. One day, he suddenly found that there was a wireless network in the building. Liyuan did not know the password of the network, but he got some i原创 2017-09-01 17:08:13 · 180 阅读 · 0 评论 -
hdu 6086 ac自动机+dp
Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta has n 01 strings si, and原创 2017-09-01 16:42:10 · 295 阅读 · 0 评论 -
hdu 5074 dp
Hatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on your own using the vocal package. Tod原创 2017-09-08 20:42:27 · 199 阅读 · 0 评论 -
hdu 5000 思维+dp
After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that this power was not as perfect as he wanted. For examp原创 2017-09-07 12:42:37 · 213 阅读 · 0 评论 -
hdu 5001 概率dp
I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling. The nation looks like a connected bidirectional graph, and I am randomly walking on it. It原创 2017-09-07 08:33:14 · 170 阅读 · 0 评论 -
hdu 6161
Problem DescriptionYou are given a complete binary tree with n nodes. The root node is numbered 1, and node x's father node is ⌊x/2⌋. At the beginning, node x has a value of exactly x. We de原创 2017-08-28 14:52:34 · 215 阅读 · 0 评论 -
hdu 5773 策略+最长上升子序列
Problem Description?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same i原创 2017-09-05 21:42:12 · 236 阅读 · 0 评论 -
hdu 5745 dp+bitset
Professor Zhang would like to solve the multiple pattern matching problem, but he only has only one pattern string p=p1p2...pmp=p1p2...pm. So, he wants to generate as many as possible pattern string原创 2017-09-04 20:51:17 · 201 阅读 · 0 评论 -
poj 3071 概率dp
FootballTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4344 Accepted: 2220DescriptionConsider a single-elimination football tournament involving原创 2017-08-14 16:49:20 · 181 阅读 · 0 评论 -
hdu 6035 Colorful Tree 树状dp
Problem DescriptionThere is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.The path between each two different nodes is uni原创 2017-07-29 11:30:25 · 223 阅读 · 0 评论 -
hdu 6078 Kanade's sum 计数dp
传送门原创 2017-08-06 10:19:55 · 222 阅读 · 0 评论 -
hdu 6143 Killer Names dp
题 目 传 送 门:题意:给出一个m个字母的字母表,问我们能生成多少对字符串,该对字符串长度为n。并且字符串之间不能存在相同的字母思路1:dp[i][j]表示用j中颜色去涂i个格子(j中颜色全用上),然后直接dp。状态转移方程为:dp[i][j]=dp[i-1][j]*j+dp[i-1][j-1]*(m-(j-1));ac代码:#include using names原创 2017-08-18 12:10:35 · 201 阅读 · 0 评论 -
hdu 6092 Rikka with Subset 逆向背包
题 目 传 送 门题意:题中给出一个序列的两个性质1.序列中数的个数为n2.序列中所有数之和为m然后给出和为0~m的子序列的个数,最后让我们确定这个序列思路:比赛的时候写的是正向背包,一直re,后来发现从前往后加的话就有好多就覆盖了但是如果写反向背包的话就不会出现这种情况ac代码:#includeusing namespace std;const原创 2017-08-09 13:02:31 · 358 阅读 · 0 评论 -
hdu 5136 Yue Fei's Battle
Yue Fei is one of the most famous military general in Chinese history.He led Southern Song army in the wars against the Jin dynasty of northern China. Yue Fei achieved a lot of victory and hopefully c原创 2017-08-01 10:47:42 · 263 阅读 · 0 评论 -
hdu 4571 Travel in time 最短路+dp
Bob gets tired of playing games, leaves Alice, and travels to Changsha alone. Yuelu Mountain, Orange Island, Window of the World, the Provincial Museum etc...are scenic spots Bob wants to visit. Howev原创 2017-06-02 19:49:33 · 256 阅读 · 0 评论 -
hdu 1024 dp
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. Gi原创 2017-10-02 11:45:22 · 242 阅读 · 0 评论