三个串的最长公共子序列

直接放dsy大佬的思路：

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<stdlib.h>
#include <string.h>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<time.h>
using namespace std;
#define MAX_N 305
#define inf 0x3f3f3f3f
#define LL long long
#define ull unsigned long long
const LL INF = 9e18;
const int mod = 1e8+7;
typedef pair<LL, LL>P;

int dp[MAX_N][MAX_N][MAX_N];
char a[MAX_N];
char b[MAX_N];
char c[MAX_N];
int la;
int lb;
int lc;
stack<char>ans;
void print()
{
    int i = la;
    int j = lb;
    int k = lc;
    cout << dp[i][j][k] << endl;
    while(i && j && k && dp[i][j][k]) {
        if(dp[i][j][k] == dp[i-1][j-1][k-1]+1 && a[i]==b[j] && b[j]==c[k]) {
            ans.push(a[i]), i--, j--, k--;
        }
        else if(dp[i][j][k] == dp[i-1][j][k])
            i--;
        else if(dp[i][j][k] == dp[i][j-1][k])
            j--;
        else if(dp[i][j][k] == dp[i][j][k-1])
            k--;
    }
    while(!ans.empty()) {
        printf("%c",ans.top());
        ans.pop();
    }
    puts("");
}
int main()
{
    gets(a+1);
    gets(b+1);
    gets(c+1);
    la = strlen(a+1);
    lb = strlen(b+1);
    lc = strlen(c+1);
    memset(dp, 0, sizeof(dp));
    for(int i=1; i<=la; i++) {
        for(int j=1; j<=lb; j++) {
            for(int k=1; k<=lc; k++) {
                dp[i][j][k] = max(dp[i-1][j][k],max(dp[i][j-1][k], dp[i][j][k-1]));
                if(a[i] == b[j] && b[j] == c[k])
                    dp[i][j][k] = max(dp[i][j][k], dp[i-1][j-1][k-1]+1);
            }
        }
    }
    print();
}