UVa 10405 - Longest Common Subsequence

题目：最大公共子序列。

分析：dp。赤果果lcs。

注意：串的元素中有空格。

#include <stdio.h>#include <stdlib.h>#include <string.h>int  f[1005][1005]; char a[1005];char b[1005];int main(){while ( gets(a) && gets(b) ) {memset( f, 0, sizeof(f) );int l1 = strlen(a);int l2 = strlen(b);for ( int i = 1 ; i <= l1 ; ++ i )for ( int j = 1 ; j <= l2 ; ++ j )if ( a[i-1] == b[j-1] )f[i][j] = f[i-1][j-1]+1;elsef[i][j] = f[i-1][j]>f[i][j-1]?f[i-1][j]:f[i][j-1];printf("%d\n",f[l1][l2]);}return 0;}