动态规划dp
关注
分享
扫一扫
CC_且听风吟
行百里者半九十
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
动态规划dp基础：求最大上升子序列和
题面：Super Jumping! Jumping! Jumping!Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I ...原创 2019-03-14 17:11:10 · 765 阅读 · 0 评论 -
LCSubstring、LCSequence、LIS、LCIS、LICS
搞清楚一个事情：连续子序列==子串，这几个真的分不清楚子串：必须连续子序列：元素来自原串中，可以不连续1. // LCSubstring – 最长公共子串（两个串）最长公共子串长度就为max{c[i][j]}了int longestSubstring(string x, string y) { vector<vector<int> > f(x...原创 2019-01-19 15:33:55 · 359 阅读 · 0 评论 -
POJ 1742 Coins 多重背包
POJ1742CoinsTime Limit:3000MS Memory Limit:30000K Total Submissions:47417 Accepted:15982 DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An ...原创 2019-07-18 22:18:40 · 235 阅读 · 0 评论