hihocoder offer收割编程练习赛12 B 一面砖墙

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #include <map>
 5 using namespace std;
 6 
 7 int n, x, tmp, num[100005];
 8 map<int, int> mp;
 9 
10 int main()
11 {
12     int cnt = 0;
13     cin >> n;
14     for (int i = 0; i < n; i++)
15     {
16         cin >> x;
17         int tot = 0;
18         for (int j = 0; j < x; j++)
19         {
20             cin >> tmp;
21             tot += tmp;
22             if (!mp.count(tot))
23             {
24                 mp[tot] = ++cnt;
25                 num[mp[tot]] = 1;
26             }
27             else
28                 num[mp[tot]]++;
29         }
30     }
31     sort(num, num + cnt);
32     cout << n - num[cnt - 2] << endl;
33     return 0;
34 }