![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-dp-LCS
拔丝奶糖54
许我向你看,lllll
展开
-
LCS 求最长公共子序列 dp
【1】求最长公共子序列 要求可以不连续 不输出,只求长度;#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>#include<string>#include<cmath>#include<vector>using namespace std;#define N 100000int s[原创 2017-11-30 14:06:17 · 198 阅读 · 0 评论 -
编辑距离 dp
求一个串变换成另一个串的最小步数:删除是一步,增加是一步,更改是一步;#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>#include<string>#include<cmath>using namespace std;#define N 100000int ptr[10000][1000];原创 2017-11-30 16:53:54 · 184 阅读 · 0 评论 -
hdu 4323 Magic Number 编辑距离
Magic NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2209 Accepted Submission(s): 936Problem Description There are many magic number原创 2017-11-30 16:58:56 · 220 阅读 · 0 评论