POJ 2771

 #include <iostream>
 #include <string>
 #define MAXN 505

 using namespace std;

 int _m[MAXN][MAXN];
 int match[MAXN];
 bool ck[MAXN];

 struct node
 {
     int _high;
     char M_F;
     string _music;
     string _habit;
 };
 int hungary(int a,int b);
 node _node[MAXN];

 int main()
 {
    // freopen("acm.acm","r",stdin);
     int test;
     int i;
     int j;
     int n;
     cin>>test;
     while(test --)
     {
         cin>>n;
         for(i = ; i < n; ++ i)
         {
             cin>>_node[i]._high;
             cin>>_node[i].M_F;
             cin>>_node[i]._music;
             cin>>_node[i]._habit;
         }
         memset(_m,,sizeof(_m));
         for(i = ; i < n; ++ i)
         {
             for(j = ; j < i; ++ j)
             {
                 if(abs(_node[i]._high-_node[j]._high) <=  && _node[i].M_F != _node[j].M_F && _node[i]._music == _node[j]._music && _node[i]._habit != _node[j]._habit)
                 {
                     _m[i][j] = ;
                     _m[j][i] = ;
                 }
             }
         }
         cout<<n-hungary(n,n)/<<endl;
     }
 }

 /////////////////////////////////////////////////////////////////////////
 //hungary算法，自己写的模板！
 /////////////////////////////////////////////////////////////////////////
 bool search(int a,int b,int x)
 {
     int i;
     int t;
         for ( i =  ; i < b ; i++)
         if (_m[x][i] && ! ck[i])
         {
             ck[i] = true;
             t = match[i];
             match[i] = x;
             if (t == - || search(a,b,t))
                 return true;
             match[i] = t;
         }
     return false;
 }

 int hungary(int a,int b)
 {
     memset(match,-,sizeof(match));
     int max_match = ;
     int i;
     for ( i =  ; i < a ; i++)
     {
         memset(ck,false,sizeof(ck));
         if (search(a,b,i))
             max_match++;
     }
     return max_match;
 }