题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1346
题目大意:赤裸裸的最长递增子序列。
解题思路:状态转移方程:if (arr[i] == brr[i]) dp[i][j] = max(dp[i][j],dp[i-1][j-1] + 1);
else dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
测试数据:
a1b2c3d4e zz1yy2xx3ww4vv
abcdefghijklmnopqrstuvwxyz a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0
abcdefghijklmnzyxwvutsrqpo opqrstuvwxyzabcdefghijklmn
代码:
#include <stdio.h> #include <string.h> #define MAX 1100 #define max(a,b) (a) > (b) ? (a) : (b) int n,m,ans,dp[MAX][MAX]; char fstr[MAX],sstr[MAX]; int main() { int i,j,k,t; while (gets(fstr+1) != NULL) { gets(sstr+1); memset(dp,-1,sizeof(dp)); ans = 0; n = strlen(fstr+1); m = strlen(sstr+1); for (i = 0; i <= n; ++i) dp[i][0] = 0; for (j = 0; j <= m; ++j) dp[0][j] = 0; for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) { if (fstr[i] == sstr[j]) dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1); else dp[i][j] = max(dp[i-1][j],dp[i][j-1]); ans = max(dp[i][j],ans); } printf("%d\n",ans); } }
本文ZeroClock原创,但可以转载,因为我们是兄弟。