ACM POJ 1458 Common Subsequence

题目大意：输入两个字符串，求出最长公共子序列的长度。

算法思想

DP

用c[][]存储a[]与b[]的最长公共子序列长度。递归方程 c[i][j]=  0         i or j =0

                                                                                                    = c[i-1][j-1] +1       if  a[i]==b[j]

                                                                                                    = max{c[i-1][j],c[i][j-1]}  a[i]!=b[j]

 代码如下

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int MAX=1000;
int c[MAX][MAX];

void LCS(char a[],char b[],int m,int n){

    for(int i=0;i<=m;i++){
        c[i][0]=0;
    }
    for(int j=0;j<=n;j++){
        c[0][j]=0;
    }
    for(int i=1;i<=m;i++){
        for(int j=1;j<=n;j++){
           if(a[i]==b[j]) c[i][j]=c[i-1][j-1]+1; 
           else if(c[i-1][j]>c[i][j-1]) c[i][j]=c[i-1][j];
           else c[i][j]=c[i][j-1];
        }
    }
}

int main(){
   char a[MAX],b[MAX];
while(scanf("%s%s",a,b)!=EOF){
   int m=strlen(a);
   int n=strlen(b);
   for(int i=m;i>=0;i--){
        a[i+1]=a[i];
   }
   for(int i=n;i>=0;i--){
        b[i+1]=b[i];
   }
    LCS(a,b,m,n);
    cout<<c[m][n]<<endl;
  }
  return 0;
}