HDU1528二分匹配标准代码～

//题目大意：Adam和Eve打牌，Eve可以看到Adam的牌，牌的顺序先看大小，如果大小一样，再看C,D，SorH（依次增大），每次出一张牌，大的赢一次，求出Eve能赢得最多次。#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 2000000000
#define EPS 1e-6
typedef long long LL;
const double PI = acos(-1.0);
//#pragma comment(linker, "/STACK:102400000,102400000")
inline int sgn(double x)
{
    return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}

int getvalue(char s[])
{
    int sum = 0;
    if (s[0] >= '2' && s[0] <= '9')
        sum += s[0] - '0';
    else if (s[0] == 'T')
        sum = 10;
    else if (s[0] == 'J')
        sum = 11;
    else if (s[0] == 'Q')
        sum = 12;
    else if (s[0] == 'K')
        sum = 13;
    else if (s[0] == 'A')
        sum = 14;
    sum *= 100;//数值既然优先判断，就让他来的猛烈些吧
    if (s[1] == 'H')
        sum += 4;
    else if (s[1] == 'S')
        sum += 3;
    else if (s[1] == 'D')
        sum += 2;
    else
        sum += 1;

    return sum;
}
const int N = 100;
std::vector<int> mp[N];
int pre[N];
int flag[N];
int find(int cur)
{
    int k;
    for (int i = 0; i < mp[cur].size(); i++)
    {
        k = mp[cur][i];
        if (!flag[k])
        {
            flag[k] = true;
            if (pre[k] == -1 || find(pre[k]))
            {
                pre[k] = cur;
                return 1;
            }
        }
    }
    return 0;
}
void clearmp()
{
    for (int i = 0; i < N; i++)
    {
        mp[i].clear();
    }
}
int main()
{
#ifdef DeBUGs
    freopen("//home//amb//桌面//1.in", "r", stdin);
#endif
    int T;
    scanf("%d", &T);
    while (T--)
    {
        int n;
        scanf("%d", &n);
        int carda[100] = zero;
        int carde[100] = zero;
        char s[10];
        clearmp();
        for (int i = 0; i < n; i++)
        {
            scanf("%s", s);
            carda[i] = getvalue(s);
        }
        for (int i = 0; i < n; i++)
        {
            scanf("%s", s);
            carde[i] = getvalue(s);
        }
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (carde[i] > carda[j])
                {
                    mp[i].push_back(j);
                }
            }
        }
        int sum = 0;
        memset(pre, -1, sizeof(pre));
        for (int i = 0; i < n; i++)
        {
            memset(flag, 0, sizeof(flag));
            sum += find(i);
        }
        printf("%d\n", sum);
    }

    return 0;
}