codeforces-scrape

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

1928B.md (2472B)


      1 Source: https://codeforces.com/problemset/problem/1928/B
      2 
      3 B. Equalize
      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 Vasya has two hobbies — adding permutations$^{\dagger}$ to arrays and finding the most frequently occurring element. Recently, he found an array $a$ and decided to find out the maximum number of elements equal to the same number in the array $a$ that he can obtain after adding some permutation to the array $a$.
     22 
     23 More formally, Vasya must choose exactly one permutation $p_1, p_2, p_3, \ldots, p_n$ of length $n$, and then change the elements of the array $a$ according to the rule $a_i := a_i + p_i$. After that, Vasya counts how many times each number occurs in the array $a$ and takes the maximum of these values. You need to determine the maximum value he can obtain.
     24 
     25 $^{\dagger}$A permutation of length $n$ is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ($2$ appears twice in the array), and $[1,3,4]$ is also not a permutation ($n=3$ but there is $4$ in the array).
     26 
     27 Input
     28 
     29 Each test consists of multiple test cases. The first line contains a single integer $t$ ($1 \leq t \leq 2 \cdot 10^4$) — the number of test cases. Then follows the description of the test cases.
     30 
     31 The first line of each test case contains a single integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of the array $a$.
     32 
     33 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) — the elements of the array $a$.
     34 
     35 It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.
     36 
     37 Output
     38 
     39 For each test case, output a single number — the maximum number of elements equal to the same number after the operation of adding a permutation.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 7
     47 
     48 2
     49 
     50 1 2
     51 
     52 4
     53 
     54 7 1 4 1
     55 
     56 3
     57 
     58 103 102 104
     59 
     60 5
     61 
     62 1 101 1 100 1
     63 
     64 5
     65 
     66 1 10 100 1000 1
     67 
     68 2
     69 
     70 3 1
     71 
     72 3
     73 
     74 1000000000 999999997 999999999
     75 ```
     76 
     77 Output
     78 
     79 ```
     80 2
     81 2
     82 3
     83 2
     84 1
     85 1
     86 2
     87 ```
     88 
     89 Note
     90 
     91 In the first test case, it is optimal to choose $p = [2, 1]$. Then after applying the operation, the array $a$ will be $[3, 3]$, in which the number $3$ occurs twice, so the answer is $2$.
     92 
     93 In the second test case, one of the optimal options is $p = [2, 3, 1, 4]$. After applying the operation, the array $a$ will be $[9, 4, 5, 5]$. Since the number $5$ occurs twice, the answer is $2$.