hdu 3722 Card Game (km)

感觉题中这句“Jimmy wants to stick them into several circles, and each card belongs to one circle exactly.”就是吓唬人的，事实上任意两个字符串都能形成环（并不需要一定有公共前缀， 若没有，score为0）。那这样就成了一个裸的KM了。。。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<fstream>
#include<sstream>
#include<cstdlib>
#include<vector>
#include<string>
#include<cstdio>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<set>
#define FF(i, a, b) for(int i=a; i<b; i++)
#define FD(i, a, b) for(int i=a; i>=b; i--)
#define REP(i, n) for(int i=0; i<n; i++)
#define CLR(a, b) memset(a, b, sizeof(a))
#define debug puts("**debug**")
#define LL long long
#define PB push_back
#define MP make_pair
#define eps 1e-8
using namespace std;

const int maxn = 222;
const int INF = 1e9;
int n;
char ch[maxn][1111];

struct KM
{
    int n, w[maxn][maxn];
    int lx[maxn], ly[maxn], left[maxn];
    bool S[maxn], T[maxn];

    bool match(int i)
    {
        S[i] = true;
        FF(j, 1, n+1) if(lx[i] + ly[j] == w[i][j] && !T[j])
        {
            T[j] = true;
            if(!left[j] || match(left[j]))
            {
                left[j] = i;
                return true;
            }
        }
        return false;
    }

    void update()
    {
        int a = INF;
        FF(i, 1, n+1) if(S[i])
        FF(j, 1, n+1) if(!T[j])
            a = min(a, lx[i] + ly[j] - w[i][j]);
        FF(i, 1, n+1)
        {
            if(S[i]) lx[i] -= a;
            if(T[i]) ly[i] += a;
        }
    }

    int km()
    {
        FF(i, 1, n+1)
        {
            left[i] = lx[i] = ly[i] = 0;
            FF(j, 1, n+1)
                lx[i] = max(lx[i], w[i][j]);
        }
        FF(i, 1, n+1)
        {
            for(;;)
            {
                FF(j, 1, n+1)   S[j] = T[j] = false;
                if(match(i)) break;
                else update();
            }
        }
        int ret = 0;
        FF(i, 1, n+1) if(left[i]) ret += w[left[i]][i];
        return ret;
    }

}solver;

int get(char *a, char *b)
{
    int lena = strlen(a), lenb = strlen(b);
    int i=0, j=lenb-1;
    while(i < lena && j >= 0)
    {
        if(a[i] != b[j]) break;
        i++;
        j--;
    }
    return i;
}

int main()
{
    while(~scanf("%d", &n))
    {
        solver.n = n;
        FF(i, 1, n+1) scanf("%s", ch[i]);
        FF(i, 1, n+1) FF(j, 1, n+1)
        {
            if(i == j) solver.w[i][j] = 0;
            else solver.w[i][j] = get(ch[i], ch[j]);
        }
        printf("%d\n", solver.km());
    }
    return 0;
}