#include <stdio.h>
#include <string.h>
int max(int a, int b) {
return (a > b) ? a : b;
}
int lcs(char* str1, char* str2, int m, int n) {
int dp[m + 1][n + 1];
int i, j;
for (i = 0; i <= m; i++)
dp[i][0] = 0;
for (j = 0; j <= n; j++)
dp[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (str1[i - 1] == str2[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
return dp[m][n];
}
int main() {
char str1[] = "ABCD";
char str2[] = "ACDF";
int m = strlen(str1);
int n = strlen(str2);
int length = lcs(str1, str2, m, n);
printf("最长公共子序列的长度为: %d\n", length);
return 0;
}