HDU 2144 (最长连续公共子列 + 并查集) Evolution

我发现我一直理解错题意了，这里的子序列指的是连续子序列，怪不得我写的LCS一直WA

顺便复习一下并查集

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 111;
int dp[maxn][maxn], parent[maxn], len[maxn];
char DNA[maxn][maxn];

int LCS(int a, int b)
{
    int ans = 0;
    memset(dp,0,sizeof(dp));
    for(int i = 1; i <= len[a]; ++i)
        for(int j = 1; j <= len[b]; ++j)
        {
            if(DNA[a][i-1] == DNA[b][j-1])
                dp[i][j] = dp[i-1][j-1] + 1;
            if(dp[i][j] > ans)
                ans = dp[i][j];
        }
    return ans;
}

int GetParent(int a) 
{
    return parent[a] == a ? a : parent[a] = GetParent(parent[a]);
}

int main(void)
{
    #ifdef LOCAL
        freopen("2144in.txt", "r", stdin);
    #endif

    int n, kase = 0;
    double p;
    while(scanf("%d %lf", &n, &p) == 2)
    {
        for(int i = 0; i < n; ++i)
        {
            scanf("%s", DNA[i]);
            parent[i] = i;
            len[i] = strlen(DNA[i]);
        }
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < i; ++j)
            {
                int pi = GetParent(i);
                int pj = GetParent(j);
                if(pi == pj)    continue;
                double x = LCS(i, j) * 100.0;
                if(x/len[i]>p && x/len[j]>p)
                    parent[pi] = pj;
            }
        int ans = 0;
        for(int i = 0; i < n; ++i)
            if(parent[i] == i)
                ++ans;
        printf("Case %d:
%d
", ++kase, ans);
    }
    return 0;
}