Advanced Fruits HDU - 1503

题目传送门

题意：给你两个字符串把这两个字符串合并起来，公共子串只输出一次。

思路：这个题目记录一下路径就可以了，一开始没有看到是Special judge想了很久的输出方案，如果是Special judge就直接标记了以后输出就可以了。

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define MAXN 110
#define MAXE 5
#define INF 1000000000
#define MOD 10007
#define LL long long
#define ULL unsigned long long
#define pi 3.14159

using namespace std;

int dp[MAXN][MAXN];
int p[MAXN][MAXN];
string str1, str2;

void print(int x, int y) {
    if (x == 0 && y == 0) {
        return;
    }
    if (p[x][y] == 1) {
        print(x - 1, y - 1);
        cout << str1[x - 1];
    } else if (p[x][y] == 2) {
        print(x, y - 1);
        cout << str2[y - 1];
    } else if (p[x][y] == 3){
        print(x - 1, y);
        cout << str1[x - 1];
    } else {
        if (x > 0) {
            print(x - 1, y);
            cout << str1[x -1];
        } else if (y > 0) {
            print(x, y - 1);
            cout << str2[y -1];
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    while (cin >> str1 >> str2) {
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= str1.length(); ++i) {
            for (int j = 1; j <= str2.length(); ++j) {
                if (str1[i - 1] == str2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                    p[i][j] = 1;
                } else if (dp[i][j - 1] >= dp[i - 1][j]) {
                    dp[i][j] = dp[i][j - 1];
                    p[i][j] = 2;
                } else {
                    dp[i][j] = dp[i - 1][j];
                    p[i][j] = 3;
                }
            }
        }
        print((int) str1.length(), (int) str2.length());
        cout << endl;
    }
    return 0;
}