两种方法求LCS（最长公共子序列）

二维数组方法：

// LCS 2-D

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000 + 7;

int n, m;   
int a[MAXN], b[MAXN];
int dp[MAXN][MAXN];
int trace[MAXN][MAXN];

void printTrace(int i, int j) {
  if(i == 0 && j== 0) {
    return ;
  }
  if(trace[i][j] == 1) {
    printTrace(i - 1, j - 1);
    printf("%d -> ", a[i]);
  } else if(trace[i][j] == 2) {
    printTrace(i - 1, j);
  } else {
    printTrace(i, j - 1);
  }
}

int main() {
   while(scanf("%d %d", &n, &m) != EOF) {
     for(int i = 1; i <= n; ++i) {
       scanf("%d", a + i);
     }
     for(int i = 1; i <= m; ++i) {
       scanf("%d", b + i);
     }
     memset(dp, 0, sizeof(dp));
     memset(trace, 0, sizeof(trace));
     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;
           trace[i][j] = 1;
         } else if(dp[i-1][j] >= dp[i][j-1]) {
           dp[i][j] = dp[i-1][j];
           trace[i][j] = 2;  // up
         } else {  
           dp[i][j] = dp[i][j-1];
           trace[i][j] = 3;  // left
         }
       }
     }
     printf("%d\n", dp[n][m]);
     printTrace(n, m);
   }
   return 0;
}

滚动数组方法：

// LCS 1-D

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000000 + 7;

int n, m;   
int a[MAXN], b[MAXN];
int dp[2][MAXN];

int main() {
   while(scanf("%d %d", &n, &m) != EOF) {
     for(int i = 1; i <= n; ++i) {
       scanf("%d", a + i);
     }
     for(int i = 1; i <= m; ++i) {
       scanf("%d", b + i);
     }
     memset(dp, 0, sizeof(dp));
     for(int i = 1; i <= n; ++i) {
      for(int j = 1; j <= m; ++j) {
          if(a[i] == b[j]) {
            dp[i % 2][j] = dp[(i - 1) % 2][j - 1] + 1;
          } else {
            dp[i % 2][j] = max(dp[(i - 1) % 2][j], dp[i % 2][j - 1]);
          }
        }
      }
       printf("%d\n", dp[n % 2][m]);
   }
   return 0;
}