西工大算法设计与分析 1041最长公共子序列(实验四）

#include<iostream>
#include<cstring>
using namespace std;

const int N = 210;
char a[N], b[N];
int f[N][N];

int main()
{
    cin >> a + 1 >> b + 1;
    a[0] = ' ', b[0] = ' ';
    int la = strlen(a) - 1, lb = strlen(b) - 1;
    for(int i = 1; i <= la; i ++ )
    	for(int j = 1; j <= lb; j ++ )
        {
            if(a[i] == b[j])    f[i][j] = f[i - 1][j - 1] + 1;
            else f[i][j] = max(f[i - 1][j], f[i][j - 1]);        	
		}
    cout << f[la][lb] << endl;
    return 0;
}