CodeForces - 1325B

aasdasdasdasdasdasd

Ehab has an array aa of length nn. He has just enough free time to make a new array consisting of nn copies of the old array, written back-to-back. What will be the length of the new array's longest increasing subsequence?

A sequence aa is a subsequence of an array bb if aa can be obtained from bb by deletion of several (possibly, zero or all) elements. The longest increasing subsequence of an array is the longest subsequence such that its elements are ordered in strictly increasing order.

Input

The first line contains an integer tt — the number of test cases you need to solve. The description of the test cases follows.

The first line of each test case contains an integer nn (1 \le n \le 10^51≤n≤105) — the number of elements in the array aa.

The second line contains nn space-separated integers a_1a1​, a_2a2​, \ldots…, a_{n}an​ (1 \le a_i \le 10^91≤ai​≤109) — the elements of the array aa.

The sum of nn across the test cases doesn't exceed 10^5105.

Output

For each testcase, output the length of the longest increasing subsequence of aa if you concatenate it to itself nn times.

Sample 1

Inputcopy	Outputcopy
2 3 3 2 1 6 3 1 4 1 5 9	3 5

Note

In the first sample, the new array is [3,2,\textbf{1},3,\textbf{2},1,\textbf{3},2,1][3,2,1,3,2,1,3,2,1]. The longest increasing subsequence is marked in bold.

In the second sample, the longest increasing subsequence will be [1,3,4,5,9][1,3,4,5,9].

翻译器翻译:

Ehab有一个数组aa长度nn。他有足够的空闲时间来制作一个新的数组nn背对背写入的旧数组的副本。新数组的最长递增子序列的长度是多少？

一个序列aa是数组的子序列bb如果aa可从获得bb通过删除几个(可能是零个或全部)元素。数组的最长递增子序列是这样的最长子序列，它的元素以严格递增的顺序排列。

投入

第一行包含一个整数tt—您需要解决的测试用例的数量。测试用例的描述如下。

每个测试用例的第一行包含一个整数nn (1 \勒恩\勒10^51≤n≤105)—数组中元素的数量aa.

第二行包含nn空格分隔的整数a1号a1​, a2a2​, \ldots…, a_{n}an​ (1 \ 10^9阿乐1≤ai​≤109)—数组的元素aa.

的总和nn跨测试用例不超过10^5105.

输出

对于每个测试用例，输出最长递增子序列的长度aa如果你把它连接到自己身上nn时代周刊。

样本1

投入复制	输出复制
2 3 3 2 1 6 3 1 4 1 5 9	3 5

注意

在第一个示例中，新数组是[3，2，\textbf{1}，3，\textbf{2}，1，\textbf{3}，2，1][3,2,1,3,2,1,3,2,1]。最长的递增子序列用粗体标记。

在第二个样本中，最长的递增子序列将是[1,3,4,5,9][1,3,4,5,9].

c++代码:

#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		set<int>st;//set自动消除重复元素且排序
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			int x;
			cin>>x;
			st.insert(x);
		}
		cout<<st.size()<<endl;
	}
	return 0;
}

stl-set容器代码: 

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long a,b,d,s[100010];
	cin>>a;
	while(a--){
		cin>>b;
		for(int i=0;i<b;i++){
			cin>>s[i];
		}
		sort(s,s+b);
		d=0;
		for(int i=1;i<b;i++){
			if(s[i]==s[i-1]) d++;
		}
		long long ans=b-d;
		cout<<ans<<endl;
	}
	return 0;
}