1 | #include<bits/stdc++.h> |
2 | using namespace std; |
3 | #define int long long |
4 | const int N=2*1e5+10; |
5 | int n; |
6 | int a[N]; |
7 | signed main() |
8 | { |
9 | int t; |
10 | cin>>t; |
11 | while(t--) |
12 | { |
13 | cin>>n; |
14 | int ans=0; |
15 | for(int i=1;i<=n;i++) |
16 | { |
17 | cin>>a[i]; |
18 | } |
19 | sort(a+1,a+n+1); |
20 | int num=1,num2=0; |
21 | for(int i=2;i<=n;i++) |
22 | { |
23 | if(a[i]-a[i-1]==1) |
24 | { |
25 | if(num==num2) |
26 | { |
27 | ans=max(ans,num2); |
28 | } |
29 | else if(num>num2) |
30 | { |
31 | ans+=num-num2; |
32 | } |
33 | num2=num; |
34 | num=1; |
35 | } |
36 | else if(a[i]==a[i-1]) |
37 | { |
38 | num++; |
39 | } |
40 | else |
41 | { |
42 | ans+=num; |
43 | num2=num; |
44 | num=1; |
45 | } |
46 | } |
47 | if(num==num2) |
48 | { |
49 | ans=max(ans,num2); |
50 | } |
51 | else if(num>num2) |
52 | { |
53 | ans+=num-num2; |
54 | } |
55 | num2=num; |
56 | num=1; |
57 | cout<<ans<<"\n"; |
58 | } |
59 | return 0; |
60 | } |