HDU 1503（Advanced Fruits）

最长公共子序列题，合并两个字符串的过程中搜索最长公共子序列，并标记各字符的状态，公共子序列中的字符只输出一次。

#include <iostream>
using namespace std;
const int MAXN = 105;

char s1[MAXN], s2[MAXN];
int dp[MAXN][MAXN];
int mark[MAXN][MAXN];
int len1, len2;

//搜索s1和s2的最长公共子序列
void LCS()
{
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= len1; i++)
        mark[i][0] = 1;
    for (int i = 1; i <= len2; i++)
        mark[0][i] = -1;
    for (int i = 1; i <= len1; i++)
    {
        for (int j = 1; j <= len2; j++)
        {
            if (s1[i - 1] == s2[j - 1])
            {
                dp[i][j] = dp[i - 1][j - 1] + 1;
                mark[i][j] = 0;
            }
            else if (dp[i - 1][j] >= dp[i][j - 1])
            {
                dp[i][j] = dp[i - 1][j];
                mark[i][j] = 1;
            }
            else
            {
                dp[i][j] = dp[i][j - 1];
                mark[i][j] = -1;
            }
        }
    }
}

//输出合并后的字符串
void output(int i, int j)
{
    if (i == 0 && j == 0)
        return;
    if (mark[i][j] == 0)
    {
        output(i - 1, j - 1);
        cout << s1[i - 1];
    }
    else if (mark[i][j] == 1)
    {
        output(i - 1, j);
        cout << s1[i - 1];
    }
    else
    {
        output(i, j - 1);
        cout << s2[j - 1];
    }
}

int main()
{
    while (cin >> s1 >> s2)
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        LCS();
        output(len1, len2);
        cout << endl;
    }
    return 0;
}

继续加油。