POJ 3692 Kindergarten【最大点独立集】

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 using namespace std;
 5 
 6 const int maxn = 205;
 7 
 8 int vis[maxn];
 9 int Link[maxn];
10 int G[maxn][maxn];
11 int n;
12 bool Find(int i) {
13     for(int j = 1; j <= n; j++) {
14         if(G[i][j] == 0 && vis[j] == 0) {
15             vis[j] = 1;
16             if(Link[j] == -1 || Find(Link[j])) {
17                 Link[j] = i;
18                 return true;
19             }
20         }
21     }
22     return false;
23 }
24 
25 int solve() {
26     memset(Link, -1, sizeof(Link));
27     int cnt = 0;
28     for(int i = 1; i <= n; i++) {
29         memset(vis, 0, sizeof(vis));
30         if(Find(i)) cnt++;
31     }
32     return cnt;
33 }
34 
35 int main() {
36     int kase = 1;
37     int m, k, x, y;
38     while(scanf("%d %d %d",&n, &m, &k) && ( n + m + k ) ) {
39         memset(G, 0, sizeof(G));
40         while(k--) {
41             scanf("%d %d",&x, &y);
42             G[x][y] = 1;
43         }
44         int nn = n;
45         n = max(n, m);
46         printf("Case %d: %d\n",kase++, n * 2 - solve() );
47     }
48     return 0;
49 }