Uva 10405-Longest Common Subsequence（DP）

题目链接：点击打开链接

裸LCS 注意输入可能有空格 

#include <algorithm>#include <iostream>#include <cstring>#include <cstdlib>#include <string>#include <cctype>#include <vector>#include <cstdio>#include <cmath>#include <queue>#include <stack>#include <map>#include <set>#define maxn 1005#define _ll __int64#define ll long long#define INF 0x3f3f3f3f#define Mod 1<<40+10#define pp pair<int,int>#define ull unsigned long longusing namespace std;short dp[maxn][maxn];char s[maxn],t[maxn];void solve(){memset(dp,0,sizeof(dp));int lens=strlen(s),lent=strlen(t);for(int i=1;i<=lens;i++)for(int j=1;j<=lent;j++)if(s[i-1]==t[j-1])dp[i][j]=dp[i-1][j-1]+1;elsedp[i][j]=max(dp[i-1][j],dp[i][j-1]);printf("%d\n",dp[lens][lent]);}int main(){while(gets(s)){gets(t);solve();}return 0;}