UVA 10405 Longest Common Subsequence

大意不再赘述。

思路：最长公共子序列。

吐槽一下，用scanf输入就WA，gets就AC，神马情况。。

#include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>#include <string>#include <algorithm>using namespace std;const int MAXN = 1010;char x[MAXN], y[MAXN];int d[MAXN][MAXN];void LCSlength(int n, int m){for(int i = 1; i <= n; i++) d[i][0] = 0;for(int i = 1; i <= m; i++) d[0][i] = 0;for(int i = 1; i <= n; i++)for(int j = 1; j <= m; j++){if(x[i-1] == y[j-1]) d[i][j] = d[i-1][j-1]+1;else d[i][j] = max(d[i-1][j], d[i][j-1]);}printf("%d\n", d[n][m]);}int main(){while(gets(x)){gets(y);int n = strlen(x), m = strlen(y);LCSlength(n, m);}return 0;}