poj1458Common Subsequence--LCS

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdlib>
#include <vector>
#define ll long long
#define maxn 10010
using namespace std;
char a[maxn], b[maxn];
int dp[maxn][maxn];
int main()
{
int i, j, k;

while ( ~scanf( "%s%s", a + 1, b + 1)){
int n = strlen( a + 1), m = strlen( b + 1);
for ( int i = 0; i < n; i++)
dp[i][0] = 0;
for ( int i = 0; i < m; i++)
dp[0][i] = 0;

for ( int i = 1; i <= n; i++){
for ( int j = 1; j <= m; j++){
if ( a[i] == b[j])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
printf( "%d\n", dp
[m]);
}
return 0;
}