DP
Singular__point
stay foolish ,stay hungry !
展开
-
(简单DP)HDU 2084 数塔
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 38758 Accepted Submission(s): 23102Problem Description在讲述DP算法的时候,一个经典的例子就是数原创 2016-12-05 11:04:47 · 411 阅读 · 0 评论 -
最长公共子序列 + 记录路径 ( 51 NOD DP 教程 )
题目链接: https://www.51nod.com/tutorial/course.html#!courseId=4最长公共子序列和编辑距离一样,都是先跑出 DP 二维数组,然后再往回找,最长公共子序列需要倒序输出。这两个题,先学一个,再自己推一个,效果很好。代码如下 :#include#include#include#include#include#defi原创 2017-11-02 15:37:07 · 539 阅读 · 0 评论 -
最大子矩阵(51Nod DP教程)
教程链接:https://www.51nod.com/tutorial/index.html#!tutorialId=2分析:最大子矩阵其实就是二维的最大字段和,那么求解的时候就是爆搜选出所有连续的行,把选出的行压成一行,再用一维的最大字段和求解,最后统计最大值。代码如下:#include#include#include#include#define L原创 2017-11-02 10:55:36 · 305 阅读 · 0 评论 -
poj 1837--Balance
题目链接:http://poj.org/problem?id=1837解析详见代码注释:#include#includeint dp[21][150001];//数组开到足够大 int main(){ int c,g;//挂钩数和砝码数 int cc[21],gg[21]; while(~scanf("%d%d",&c,&g)) {//模拟一架天平 for(原创 2016-12-09 20:49:29 · 343 阅读 · 0 评论 -
hdu 1516 String Distance and Transform Process(编辑距离+记录路径)
String Distance and Transform ProcessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 486 Accepted Submission(s): 228Special Judge原创 2017-10-27 18:54:42 · 634 阅读 · 0 评论 -
hdu 4472 Count(简单递推)
CountTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2465 Accepted Submission(s): 1645Problem DescriptionProf. Tigris is the原创 2017-10-05 12:38:14 · 321 阅读 · 0 评论 -
hdu 1160 排序+下降子序列变形 FatMouse's Speed
FatMouse's SpeedProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a su原创 2017-09-12 20:45:51 · 283 阅读 · 0 评论 -
HDU 1176 免费馅饼
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52921 Accepted Submission(s): 18575Problem Description都说天上不会掉馅饼,但有一天gameb原创 2017-09-12 08:54:11 · 242 阅读 · 0 评论 -
hdu 2067 卡特兰数打表(求解多边形,圆形等分割问题,括号匹配)(一直在更新。。。)
百度百科:https://baike.baidu.com/item/%E5%8D%A1%E7%89%B9%E5%85%B0%E6%95%B0/6125746?fr=aladdin卡特兰数又称卡塔兰数,英文名Catalan number,是组合数学中一个常出现在各种计数问题中出现的数列。其前几项为 : 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 167原创 2017-08-23 10:38:38 · 710 阅读 · 0 评论 -
HDU 1257 最少拦截系统
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45670 Accepted Submission(s): 17993Problem Description某国为了防御敌国的导弹袭击,发展出原创 2017-09-03 19:38:29 · 333 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem
Let SS be a sequence of integers s_{1}s1, s_{2}s2, ......, s_{n}sn Each integer is is associated with a weight by the following rules:(1) If is is negative, then its weight is 00.(2)原创 2017-09-24 21:09:19 · 263 阅读 · 0 评论 -
2017杭电ACM集训队单人排位赛 - 2 最大字段和
最大子段和Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 305 Accepted Submission(s): 120Problem Description一个大小为n的数组a1到an(-10^4≤a原创 2017-07-06 22:04:53 · 380 阅读 · 0 评论 -
HDU 1003 Max Sum
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 247744 Accepted Submission(s): 58531Problem DescriptionGiven a sequenc原创 2017-07-06 21:44:02 · 225 阅读 · 0 评论 -
石油大 2017年省赛前最后一水 1023: Pong’s Birds
1023: Pong’s Birds时间限制: 1 Sec 内存限制: 128 MB提交: 137 解决: 33[提交][状态][讨论版]题目描述In order to train his birds, Pong is holding a competition for them. (He have birds, does he?) He have 2n birds原创 2017-05-05 20:33:19 · 285 阅读 · 0 评论 -
poj 2029 Get Many Persimmon Treest
Get Many Persimmon Trees题目链接:传送门题目大意:在给定的w*h面积的土地上,随机种了一些树,给你s*t面积的矩形,让你圈儿出最多树。类比一维的最长子串儿,这里也要初始化一个数组,记录从map[1][1]到map[x][y]之间的树的数量。最后遍历每一个s*t大小的矩形。代码如下:#include#inc原创 2017-03-18 10:03:01 · 426 阅读 · 0 评论 -
HDU 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping!题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087本人也是刚开始学习dp的题,做完了数塔就来做子串,看了好久才看懂。思路详见代码:状态方程:dp[i]max(dp[i],dp[j]+a[i])#includeint main(){ int原创 2017-01-30 15:55:40 · 398 阅读 · 0 评论 -
HDU 1003 Max Sum
Max Sum 题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1003初来乍到,动态规划也是刚刚接触。刚开始用暴力法,Time limit……在网上搜了代码。大多是只说是动态规划经典问题、求最大子序列和,然后就是一串代码。最好的就是带了几行注释…没有太多通俗的解释…硬着头皮看了一晚上,终于算是有了眉目想通了。转载 2017-01-30 16:06:03 · 224 阅读 · 0 评论 -
HDU 2089 数位dp 不要62
不要62题目链接:传送门其实是做topcoder的时候碰到不会的题,看人家说要用数位dp,所以拿http://acm.hdu.edu.cn/showproblem.PHP?pid=2089来学习了一下数位dp适合在一段数的区间内找出满足某些条件的数的个数,这个时候往往不能之间遍历,肯定会超时,则一般使用数位dp来解决数位dp的常见形式是dp[i][j],表示开头是j的i位数转载 2017-02-28 21:10:34 · 248 阅读 · 0 评论 -
HDU 1159 Common Subsequence(最长公共子序列模板题)
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40985 Accepted Submission(s): 18931Problem DescriptionA sub原创 2017-08-17 21:16:19 · 323 阅读 · 0 评论