ACM_动态规划
chudongfang2015
开心开心!!!!!!
展开
-
D - Beauty of Array——ZOJ
D - Beauty of ArrayTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionEdward has an array A with N integers. He defines the beauty of原创 2016-05-10 17:58:18 · 468 阅读 · 0 评论 -
算法导论_第十六章_动态规划
动态规划个人对动态规划的理解:1.动态规划是一个付出额外空间来节省时间,就是所谓的空间换时间。2.动态规划储存每个状态的最优解。3.动态规划是用来把子问题的结果储存下来,再次用到的时候就不必再进行重复计算。算法导论对动态规划的解释:动态规划和分治方法相似,都是通过组合子问题的解来求解原问题,分治方法将问题划分为互不相交的子问题,递归的求解子问题,再将他们的解组合起来原创 2016-06-12 21:08:35 · 5867 阅读 · 2 评论 -
假期训练——OpenJ_Bailian - 4017 爬楼梯 动态规划
树老师爬楼梯,他可以每次走1级或者2级,输入楼梯的级数,求不同的走法数例如:楼梯一共有3级,他可以每次都走一级,或者第一次走一级,第二次走两级也可以第一次走两级,第二次走一级,一共3种方法。Input输入包含若干行,每行包含一个正整数N,代表楼梯级数,1 Output不同的走法数,每一行输入对应一行输出Sample Input5810Sample Outpu原创 2017-01-24 23:03:54 · 543 阅读 · 0 评论 -
假期训练——POJ - 1163 The Triangle dp
73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top a原创 2017-01-24 23:10:51 · 265 阅读 · 0 评论 -
假期训练——POJ - 3624 Charm Bracelet DP+0-1背包
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the原创 2017-01-24 23:17:12 · 338 阅读 · 0 评论 -
假期训练——CodeForces - 742D Arpa's weak amphitheater and Mehrdad's valuable Hoses DP+dfs
Just to remind, girls in Arpa's land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have so原创 2017-01-24 23:24:54 · 502 阅读 · 0 评论 -
假期训练——UVA - 10036 Divisibility DP
Consider an arbitrary sequence of integers. One can place+or-operators between integers in thesequence, thus deriving different arithmetical expressions that evaluate to different原创 2017-01-24 23:28:34 · 331 阅读 · 0 评论 -
数位DP小结
数位DP小结概述一般是求小于等于数字N的某些特征数字个数,或者是区间[L,R]的之间的某些特征数字个数,后者一般可以转换成求差的方式来做。模板数字处理函数:int f(int num){ int ans; int pos = 0; while(num){ digit[++pos]=num%10;转载 2017-05-17 23:22:41 · 385 阅读 · 0 评论 -
状压DP——2800 送外卖
2800 送外卖题目链接利用状压DP,其可以走多次用Floyd#include<iostream>#include<string>#include<vector>#include<algorithm>#include<queue>#include<cstdio>#include<cstring>#include<cmath>#include<map>#include<iomanip原创 2017-08-11 20:49:25 · 366 阅读 · 0 评论 -
动态规划——POJ 1159-Palindrome
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 the minimal number原创 2017-08-06 15:01:44 · 437 阅读 · 0 评论 -
动态规划——POJ3666 Making the Grade
DescriptionA straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an原创 2017-08-06 15:59:28 · 873 阅读 · 0 评论 -
动态规划—— E. The Values You Can Make
Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin isci. The price of the chocolate isk, so Pari will take a subset of her coins with sum equal tok and give原创 2017-08-06 23:16:49 · 499 阅读 · 0 评论 -
动态规划—— CodeForces - 812B
Some people leave the lights at their workplaces on when they leave that is a waste of resources. As a hausmeister of DHBW, Sagheer waits till all students and professors leave the university building,原创 2017-08-07 01:03:51 · 467 阅读 · 0 评论 -
区间dp总结
要点:状态必然包含区间是哪个[i,j],通过枚举区间分界点进行转移。也就是说一个大区间是由两个子区间合并来的或者是两个子区间加上中间元素合并来的! 在合并的时候自然是要满足最优化原理和无后效性原则......不能多说,到题目中去体会!这类问题经常会遇到环,环的处理办法通常有两种:謱)加倍——将数据复制加倍,就可以保证最后一个与第一个相连;謲)取余——在调用数组时对譮取余。原创 2017-09-06 21:51:06 · 319 阅读 · 0 评论 -
[简单dp]H - Happy Matt Friends HDU - 5119
H - Happy Matt Friends HDU - 5119Matt 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原创 2017-09-06 21:59:21 · 428 阅读 · 0 评论 -
895C - Square Subsets 状压DP + 离散化
C. Square Subsetstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya was late for the lesson too. The te原创 2017-11-29 11:27:11 · 521 阅读 · 0 评论 -
C - Palindrome——区间DP,巧妙的利用滚动数组
C - PalindromeTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA palindrome is a symmetrical string, that is, a string read ident原创 2016-05-23 21:16:45 · 497 阅读 · 0 评论 -
B - Longest Ordered Subsequence——HOJ
B - Longest Ordered SubsequenceTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA numeric sequence of ai is ordered if a1 a2 aN原创 2016-05-23 16:51:38 · 421 阅读 · 0 评论 -
A - Bone Collector——HOJ 简单0-1背包
A - Bone CollectorTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMany years ago , in Teddy’s hometown there was a man who was c原创 2016-05-24 11:51:28 · 538 阅读 · 0 评论 -
C - 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活——HOJ ——0-1背包 滚动数组
C - 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现原创 2016-05-24 16:45:16 · 532 阅读 · 0 评论 -
B - I NEED A OFFER!——HOJ 类0-1背包问题 +滚动数组
B - I NEED A OFFER!Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国原创 2016-05-24 15:46:02 · 461 阅读 · 0 评论 -
A - Max Sum Plus Plus——POJ
A - Max Sum Plus PlusTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" prob原创 2016-05-11 20:20:59 · 564 阅读 · 0 评论 -
C - Monkey and Banana——POJ
C - Monkey and BananaTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA group of researchers are designing an experiment to test原创 2016-05-12 15:45:57 · 532 阅读 · 0 评论 -
E - Super Jumping! Jumping! Jumping!——HOJ
E - Super Jumping! Jumping! Jumping!Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNowadays, a kind of chess game called “Super原创 2016-05-12 16:39:00 · 401 阅读 · 0 评论 -
F - Piggy-Bank——HOJ 一维DP 装载问题
F - Piggy-BankTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBefore ACM can do anything, a budget must be prepared and the nece原创 2016-05-12 19:15:10 · 492 阅读 · 0 评论 -
H - Tickets——HOJ 简单一维DP
H - TicketsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionJesus, what a great movie! Thousands of people are rushing to the cin原创 2016-05-12 20:09:58 · 404 阅读 · 0 评论 -
I - 最少拦截系统——HOJ LCS
I - 最少拦截系统Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹原创 2016-05-12 22:33:15 · 604 阅读 · 0 评论 -
R - Milking Time——POJ C语言实现
R - Milking TimeTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBessie is such a hard-working cow. In fact, she is so focused原创 2016-05-16 15:59:26 · 486 阅读 · 0 评论 -
P - FatMouse and Cheese——记忆DP探索与发现过程
P - FatMouse and CheeseTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFatMouse has stored some cheese in a city. The city can b原创 2016-05-17 00:34:12 · 628 阅读 · 0 评论 -
N - Longest Ordered Subsequence——POJ 最长递增子序列
N - Longest Ordered SubsequenceTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA numeric sequence of ai is ordered if a1 a2 aN原创 2016-05-19 10:47:44 · 850 阅读 · 0 评论 -
最长公共子序列——LCS
参考:http://blog.csdn.net/v_JULY_v/article/details/6110269最长公共子序列的DP 解决方法:其可以化简为最优的子结构记:Xi=﹤x1,⋯,xi﹥即X序列的前i个字符 (1≤i≤m)(前缀)Yj=﹤y1,⋯,yj﹥即Y序列的前j个字符 (1≤j≤n)(前缀)假定Z=﹤z1,原创 2016-05-19 16:35:15 · 394 阅读 · 0 评论 -
区间DP——1048 石子归并 codevs
1048 石子归并 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 黄金 Gold题解 有n堆石子排成一列,每堆石子有一个重量w[i], 每次合并可以合并相邻的两堆石子,一次合并的代价为两堆石子的重量和w[i]+w[i+1]。问安排怎样的合并顺序,能原创 2016-05-19 20:30:32 · 477 阅读 · 0 评论 -
A - The Triangle——HOJ
A - The TriangleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription73 88 1 02 7 4 44 5 2 6 5(Figure 1原创 2016-05-23 16:24:39 · 385 阅读 · 0 评论 -
Pick The Sticks UESTC - 1218 0-1背包变形
题目链接The story happened long long ago. One day, Cao Cao made a special order called “Chicken Rib” to his army. No one got his point and all became very panic. However, Cao Cao himself felt very proud原创 2017-11-26 21:23:30 · 317 阅读 · 0 评论