CF 1463D pairs

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N = 4e5 + 10;
 4 int a[N];
 5 int main(){
 6     cin.tie(0);cout.tie(0);
 7     ios_base::sync_with_stdio(0);
 8     int t; cin >> t;
 9     while(t--)
10     {
11         int n; cin >> n;
12         for(int i = 1 ; i <= 2 * n ; i++){
13             a[i] = 0;
14         }
15         for(int i = 1 ; i <= n ; i++){
16             int x; cin >> x;
17             a[x] = 1;
18         }
19         for(int i = 1 ; i <= 2 * n ; i++){
20             if(!a[i])    a[i] = -1;
21         }
22         for(int i = 1 ; i <= 2 * n ; i++){
23             a[i] += a[i - 1];
24         }
25         int mn = a[1], mx = a[1];
26         for(int i = 1 ; i <= 2 * n ; i++){
27             mn = min(mn, a[i]);
28             mx = max(mx, a[i]);
29         }
30         cout << n + mn - mx + 1 << endl;
31     }    
32     return 0;
33 } 

 

posted @ 2021-01-08 12:58  LegendN  阅读(338)  评论(0编辑  收藏  举报