本文共 1165 字，大约阅读时间需要 3 分钟。

题目：

The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-animal is a cat, then his/hers dislike-animal must be a dog, and vice versa.

Now the zoo administrator is removing some animals, if one child's like-animal is not removed and his/hers dislike-animal is removed, he/she will be happy. So the administrator wants to know which animals he should remove to make maximum number of happy children.

Input

The input file contains multiple test cases, for each case, the first line contains three integers N <= 100, M <= 100 and P <= 500.

Next P lines, each line contains a child's like-animal and dislike-animal, C for cat and D for dog. (See sample for details)

Output

For each case, output a single integer: the maximum number of happy children.

Sample Input

1 1 2C1 D1D1 C11 2 4C1 D1C1 D1C1 D2D2 C1

Sample Output

13    

代码如下：

#include 
   
    #include 
    
     #include 
     
      #include 
      
       using namespace std;const int maxn=505;int n,m,p;int a[maxn][maxn];int match[maxn];char dli[maxn][5];char li[maxn][5];int vis[maxn];bool Find(int x){    for (int i=0;i
      
     
    
   

 

转载地址：http://yzoen.baihongyu.com/