[TyvjP1050]动态规划求解最长公共子序列问题

1 #include
2 #include
3 #include
4
5 using std::max;
6
7 int n, m, f[2001][2001];
8 char a[2001] &＃61; {&＃39;0&＃39;}, b[2001] &＃61; {&＃39;0&＃39;};
9
10 int main()
11 {
12 int i, j;
13 scanf("%s %s", a &＃43; 1, b &＃43; 1);
14 n &＃61; strlen(a);
15 m &＃61; strlen(b);
16 for(i &＃61; 1; i )
17 for(j &＃61; 1; j )
18 if(a[i] &＃61;&＃61; b[j]) f[i][j] &＃61; max(f[i - 1][j - 1] &＃43; 1, max(f[i - 1][j], f[i][j - 1]));
19 else f[i][j] &＃61; max(f[i - 1][j], f[i][j - 1]);
20 printf("%d", f[n - 1][m - 1]);
21 return 0;
22 }