codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1682C.md (2337B)


      1 Source: https://codeforces.com/problemset/problem/1682/C
      2 
      3 C. LIS or Reverse LIS?
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given an array $a$ of $n$ positive integers.
     22 
     23 Let $\text{LIS}(a)$ denote the length of [longest strictly increasing subsequence](https://en.wikipedia.org/wiki/Longest_increasing_subsequence) of $a$. For example,
     24 
     25 * $\text{LIS}([2, \underline{1}, 1, \underline{3}])$ = $2$.
     26 * $\text{LIS}([\underline{3}, \underline{5}, \underline{10}, \underline{20}])$ = $4$.
     27 * $\text{LIS}([3, \underline{1}, \underline{2}, \underline{4}])$ = $3$.
     28 
     29 We define array $a'$ as the array obtained after reversing the array $a$ i.e. $a' = [a_n, a_{n-1}, \ldots , a_1]$.
     30 
     31 The beauty of array $a$ is defined as $min(\text{LIS}(a),\text{LIS}(a'))$.
     32 
     33 Your task is to determine the maximum possible beauty of the array $a$ if you can rearrange the array $a$ arbitrarily.
     34 
     35 Input
     36 
     37 The input consists of multiple test cases. The first line contains a single integer $t$ $(1 \leq t \leq 10^4)$  — the number of test cases. Description of the test cases follows.
     38 
     39 The first line of each test case contains a single integer $n$ $(1 \leq n \leq 2\cdot 10^5)$  — the length of array $a$.
     40 
     41 The second line of each test case contains $n$ integers $a_1,a_2, \ldots ,a_n$ $(1 \leq a_i \leq 10^9)$  — the elements of the array $a$.
     42 
     43 It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$.
     44 
     45 Output
     46 
     47 For each test case, output a single integer  — the maximum possible beauty of $a$ after rearranging its elements arbitrarily.
     48 
     49 Example
     50 
     51 Input
     52 
     53 ```
     54 3
     55 
     56 3
     57 
     58 6 6 6
     59 
     60 6
     61 
     62 2 5 4 5 2 4
     63 
     64 4
     65 
     66 1 3 2 2
     67 ```
     68 
     69 Output
     70 
     71 ```
     72 1
     73 3
     74 2
     75 ```
     76 
     77 Note
     78 
     79 In the first test case, $a$ = $[6, 6, 6]$ and $a'$ = $[6, 6, 6]$. $\text{LIS}(a) = \text{LIS}(a')$ = $1$. Hence the beauty is $min(1, 1) = 1$.
     80 
     81 In the second test case, $a$ can be rearranged to $[2, 5, 4, 5, 4, 2]$. Then $a'$ = $[2, 4, 5, 4, 5, 2]$. $\text{LIS}(a) = \text{LIS}(a') = 3$. Hence the beauty is $3$ and it can be shown that this is the maximum possible beauty.
     82 
     83 In the third test case, $a$ can be rearranged to $[1, 2, 3, 2]$. Then $a'$ = $[2, 3, 2, 1]$. $\text{LIS}(a) = 3$, $\text{LIS}(a') = 2$. Hence the beauty is $min(3, 2) = 2$ and it can be shown that $2$ is the maximum possible beauty.