CopyCopyCopyCopyCopy

题意翻译

共有 `t` 组数据，每组数据给你一个长为 `n`$(1 \leq n \leq 10^5)$ 的序列$(1 \leq a_i \leq10^9)$，将它复制 `n` 遍，请在这个复制后的序列里找一个最长上升子序列，输出它的长度。

题目描述

Ehab has an array $ a $ of length $ n $ . He has just enough free time to make a new array consisting of $ n $ copies of the old array, written back-to-back. What will be the length of the new array's longest increasing subsequence? A sequence $ a $ is a subsequence of an array $ b $ if $ a $ can be obtained from $ b $ 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.

输入输出格式

输入格式

The first line contains an integer $ t $ — 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 $ n $ ( $ 1 \le n \le 10^5 $ ) — the number of elements in the array $ a $ . The second line contains $ n $ space-separated integers $ a_1 $ , $ a_2 $ , $ \ldots $ , $ a_{n} $ ( $ 1 \le a_i \le 10^9 $ ) — the elements of the array $ a $ . The sum of $ n $ across the test cases doesn't exceed $ 10^5 $ .

输出格式

For each testcase, output the length of the longest increasing subsequence of $ a $ if you concatenate it to itself $ n $ times.

输入输出样例

输入样例 #1

2
3
3 2 1
6
3 1 4 1 5 9

输出样例 #1

3
5

说明

In the first sample, the new array is $ [3,2,\textbf{1},3,\textbf{2},1,\textbf{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] $ .