题目:
http://acm.hdu.edu.cn/showproblem.php?pid=1159
题意:
每次给定两个字符串,求两个字符串的最长公共子序列
思路:
模板题,不多说,努力学dp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 1010, INF = 0x3f3f3f3f;
int dp[N][N];
int main()
{
char s1[N], s2[N];
while(~scanf(" %s %s", s1 + 1, s2 + 1))
{
int len1 = strlen(s1 + 1), len2 = strlen(s2 + 1);
for(int i = 1; i <= len1; i++)
for(int j = 1; j <= len2; j++)
if(s1[i] == s2[j]) dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
printf("%d\n", dp[len1][len2]);
}
return 0;
}