本文共 1020 字,大约阅读时间需要 3 分钟。
#include#include #include #include using namespace std;int dp[105][105];int path[105][105];char str1[105][40],str2[105][40];int res;void fun(int count,int i,int j){ if(count == 0) return ; if(path[i][j] == 0) { fun(count-1,i-1,j-1); if(count == 1) cout< <= num;i++) { for(int j = 1;j <= num1;j++) { if(!strcmp(str1[i-1],str2[j-1])) { dp[i][j] = dp[i-1][j-1]+1; path[i][j] = 0; } else { if(dp[i][j-1] < dp[i-1][j] ) { dp[i][j] = dp[i-1][j]; path[i][j] = 1; } else { dp[i][j] = dp[i][j-1]; path[i][j] = 2; } } } } fun(dp[num][num1],num,num1); cout<
转载地址:http://ebsgi.baihongyu.com/