Advanced Fruits

Advanced Fruits HDU - 1503

记录LCS的路径

注意更新时路径

    #include<bits/stdc++.h>
    using namespace std;
    #define fst first
    #define sec second
    #define sci(num) scanf("%d",&num)
    #define scl(num) scanf("%lld",&num)
    #define mem(a,b) memset(a,b,sizeof a)
    #define cpy(a,b) memcopy(a,b,sizeof b)
    typedef long long LL;
    typedef pair<int,int> pair;
    const int MAX_N = 110;
    int pre[MAX_N][MAX_N];
    int dp[MAX_N][MAX_N];
    char s1[MAX_N],s2[MAX_N];
    void print(int a,int b) {
        if (!a && !b) return;
        if (pre[a][b] == 0) {
            print(a- 1,b - 1);
            putchar(s1[a]);
        } else if (pre[a][b] == 1) {
            print(a - 1,b);
            putchar(s1[a]);
        } else  {
            print(a ,b - 1);
            putchar(s2[b]);
        }
    }
    int main() {
    
        while (~scanf("%s%s",s1 + 1,s2 + 1)) {
            mem(pre,0); mem(dp,0);
            for (int i = 1;i <= 100;i++) pre[0][i] = 2;
            for (int i = 1;i <= 100;i++) pre[i][0] = 1;
            int len1 = strlen(s1 + 1);
            int len2 = strlen(s2 + 1);
            for (int i = 1;i <= len1;i++) {
                for (int j = 1;j <= len2;j++) {
                    if (s1[i] == s2[j]) {
                        dp[i][j] = dp[i- 1][j - 1] + 1;
                        pre[i][j] = 0;
                    } else {
                        if (dp[i - 1][j] > dp[i][j - 1]) {
                            pre[i][j] = 1;
                            dp[i][j] = dp[i - 1][j];
                        } else {
                            pre[i][j] = 2;
                            dp[i][j] = dp[i][j - 1];
                        }
                    }
                }
            }
            print(len1,len2);
            printf("\n");
    
        }
    
       return 0;
}