poj 1458 Common Subsequence 【DP】

链接 http://poj.org/problem?id=1458

代码：

/*最长公共子序列*/#include<stdio.h>#include<string.h>#define MAXN 1000+10#define max( a, b ) a > b? a:bint dp[MAXN][MAXN];int main(){int i, j;char a[MAXN], b[MAXN];while( ~scanf( "%s %s", a+1, b+1 ) ){int la = strlen(a);int lb = strlen(b);memset( dp, 0, sizeof(dp) );for( i = 0; i < la; i ++ )for( j = 0; j < lb; ++j )if( a[i] == b[j] ) dp[i+1][j+1] = dp[i][j]+1;else dp[i+1][j+1] = max( dp[i+1][j], dp[i][j+1]);printf( "%d\n", dp[la][lb] );}return 0; }