POJ 2062 & HDOJ 1528 Card Game Cheater - 阅读理解..二分图最大匹配

                   题意:

                            已知道第一个人每轮会出什么牌..自己手上有一些牌..问如何出能胜利最多...胜利的条件是比大小..首先看第一位(2,3,4,5,6,7,8,9,T,J,Q,K,A)的偏序...若相等..看第二个(C,D,S,H)的偏序...

                   题解:

                            能胜利的..够边..然后跑二分图最大匹配 ...

Program:

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<string.h>
#include<queue>
#define ll long long
#define esp 1e-5
#define MAXN 55
#define MAXM 100005
#define oo 100000007
using namespace std;  
int n,A[MAXN][2],B[MAXN][2],match[MAXN];  
bool g[MAXN][MAXN],used[MAXN];
int turn(char c)
{
       if (c>='2' && c<='9') return c-'2';
       if (c=='T' || c=='C') return 8;
       if (c=='J' || c=='D') return 9;
       if (c=='Q' || c=='S') return 10;
       if (c=='K' || c=='H') return 11;
       return 12;
}
bool dfs(int x)
{
       for (int i=1;i<=n;i++)
          if (!used[i] && g[x][i])
          {
                 used[i]=true;
                 if (!match[i] || dfs(match[i]))
                 {
                         match[i]=x;
                         return true;
                 }
          }          
       return false;
}
int getmax()
{
       int i,sum=0;
       memset(match,0,sizeof(match));
       for (i=1;i<=n;i++)
       {
               memset(used,false,sizeof(used));
               sum+=dfs(i);
       }       
       return sum;
}
int main()
{            
       int cases,i,j;
       char c;   
       scanf("%d",&cases);
       while (cases--)
       {
               scanf("%d",&n);
               for (i=1;i<=n;i++)
               {
                       do { c=getchar(); }while (c==' '|| c=='\n');
                       A[i][0]=turn(c);
                       do { c=getchar(); }while (c==' '|| c=='\n');
                       A[i][1]=turn(c);
               }
               for (i=1;i<=n;i++)
               {
                       do { c=getchar(); }while (c==' '|| c=='\n');
                       B[i][0]=turn(c);
                       do { c=getchar(); }while (c==' '|| c=='\n');
                       B[i][1]=turn(c);
               }
               memset(g,false,sizeof(g));
               for (i=1;i<=n;i++)
                   for (j=1;j<=n;j++)
                       if (B[i][0]>A[j][0] || (B[i][0]==A[j][0] && B[i][1]>A[j][1]))
                           g[i][j]=true;
               printf("%d\n",getmax());
       }     
       return 0;  
}