【HDOJ】2144 Evolution

并查集+DP。

 /* 2144 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 105

 char s[MAXN][MAXN];
 int dp[MAXN][MAXN];
 int lens[MAXN];
 int pre[MAXN];

 int find(int x) {
     if (pre[x] == x)
         return x;
     pre[x] = find(pre[x]);
     return pre[x];
 }

 void merge(int x, int y) {
     int xx = find(x);
     int yy = find(y);

     if (xx != yy) {
         pre[xx] = yy;
     }
 }

 int cal(int x, int y) {
     int i, j, k, tmp;
     int ret;

     for (j=; j<=lens[y]; ++j)
         dp[][j] = ;
     for (i=; i<=lens[x]; ++i)
         dp[i][] = ;
     ret = -;
     for (i=; i<=lens[x]; ++i) {
         for (j=; j<=lens[y]; ++j) {
             if (s[x][i] == s[y][j])
                 dp[i][j] = dp[i-][j-] + ;
             else
                 dp[i][j] = ;
             if (dp[i][j] > ret)
                 ret = dp[i][j];
         }
     }

     return ret;
 }

 int main() {
     int n, t = ;
     int i, j, k, tmp;
     int x, y;
     int ans;
     double p;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     while (scanf("%d %lf", &n, &p) != EOF) {
         for (i=; i<=n; ++i) {
             scanf("%s", s[i]+);
             pre[i] = i;
             lens[i] = strlen(s[i]+);
         }
         for (i=; i<=n; ++i) {
             for (j=; j<i; ++j) {
                 x = find(i);
                 y = find(j);
                 if (x != y) {
                     k = cal(i, j);
                     if (k*100.0/lens[i]>p && k*100.0/lens[j]>p) {
                         pre[y] = x;
                     }
                 }
             }
         }
         ans = ;
         for (i=; i<=n; ++i)
             if (pre[i] == i)
                 ++ans;

         printf("Case %d:\n%d\n", ++t, ans);
     }

     return ;
 }