codeforces 489B. BerSU Ball 解题报告

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 const int maxn = 100 + 5;
 8 int a[maxn], b[maxn];
 9 
10 int get_num(int ta[], int tb[])
11 {
12     int num = 0;
13     for (int i = 1; i <= 100; i++)
14     {
15         if (ta[i])
16         {
17             for (int j = 0; j < ta[i]; j++)
18             {
19                 if (tb[i-1])
20                 {
21                     tb[i-1]--;
22                     num++;
23                 }
24                 else if (tb[i])
25                 {
26                     tb[i]--;
27                     num++;
28                 }
29                 else if (tb[i+1])
30                 {
31                     tb[i+1]--;
32                     num++;
33                 }
34             }
35         }
36     }
37     return num;
38 }
39 
40 int main()
41 {
42     #ifndef ONLINE_JUDGE
43         freopen("in.txt", "r", stdin);
44     #endif
45 
46     int n, m, input;
47     while (scanf("%d", &n) != EOF)
48     {
49         memset(a, 0, sizeof(a));
50         memset(b, 0, sizeof(b));
51 
52         for (int i = 0; i < n; i++)
53         {
54             scanf("%d", &input);
55             a[input]++;
56         }
57         scanf("%d", &m);
58         for (int i = 0; i < m; i++)
59         {
60             scanf("%d", &input);
61             b[input]++;
62         }
63         int ans = 0;
64         ans = max(get_num(a, b), get_num(b, a));
65         printf("%d\n", ans);
66     }
67     return 0;
68 }