思维题

 

1.引入库

代码如下（示例）：

You are given an array a of length n consisting of integers. You can apply the following operation, consisting of several steps, on the array a zero or more times:

you select two different numbers in the array ai and aj;
you remove i-th and j-th elements from the array.
For example, if n=6 and a=[1,6,1,1,4,4], then you can perform the following sequence of operations:

select i=1,j=5. The array a becomes equal to [6,1,1,4];
select i=1,j=2. The array a becomes equal to [1,4].
What can be the minimum size of the array after applying some sequence of operations to it?

Input
The first line contains a single integer t (1≤t≤104). Then t test cases follow.

The first line of each test case contains a single integer n (1≤n≤2⋅105) is length of the array a.

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤109).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output
For each test case, output the minimum possible size of the array after applying some sequence of operations to it.

2.读入数据

代码如下（示例）：

Example
Input
5
6
1 6 1 1 4 4
2
1 2
2
1 1
5
4 5 4 5 4
6
2 3 2 1 3 1
Output
0
0
2
1
0

本题思路：将数组进行拆分进行对半比较

例如：a=[3,4,4,4];分开后a1=[3,4],a2=[4,4]; 显然排序后从中间向两边比较极易出现相同的数， 故本题采用:4-前半部分中间数与4-最后一位数比较 3-前半部分第一个数与4-最后一位数的比较。

三.代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
long long book[200001]={0};
long long a[200002],q;
int main()
{
	long long n,n1,t,max1;
	scanf("%lld",&n);
	while(n--)
	{
		scanf("%lld",&n1);
		long long q=n1;
		for(int i=0;i<n1;i++)
		{
			scanf("%lld",&a[i]);
		}
		sort(a,a+n1);      //将数组进行排序以便于进行比较 
		long long i,j,v=0;
		for(i=n1/2-1,j=n1-1;i>=v&&j>n1/2-1;)  //i>=v保证不会重复且在数据要求范围
		{
			if(a[i]!=a[j])
			{
				j--;i--;
				q=q-2;
			}
			else if(a[v]!=a[j])
			{
				v++;j--;
				q=q-2;
			}
			else
			{
				break;
			}
		}
	printf("%lld\n",q);
	}
	return 0;
}

---