1338A.md (2022B)
1 Source: https://codeforces.com/problemset/problem/1338/A 2 3 A. Powered Addition 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 have an array $a$ of length $n$. For every positive integer $x$ you are going to perform the following operation during the $x$-th second: 22 23 * Select some distinct indices $i_{1}, i_{2}, \ldots, i_{k}$ which are between $1$ and $n$ inclusive, and add $2^{x-1}$ to each corresponding position of $a$. Formally, $a_{i_{j}} := a_{i_{j}} + 2^{x-1}$ for $j = 1, 2, \ldots, k$. Note that you are allowed to not select any indices at all. 24 25 You have to make $a$ nondecreasing as fast as possible. Find the smallest number $T$ such that you can make the array nondecreasing after at most $T$ seconds. 26 27 Array $a$ is nondecreasing if and only if $a_{1} \le a_{2} \le \ldots \le a_{n}$. 28 29 You have to answer $t$ independent test cases. 30 31 Input 32 33 The first line contains a single integer $t$ ($1 \le t \le 10^{4}$) — the number of test cases. 34 35 The first line of each test case contains single integer $n$ ($1 \le n \le 10^{5}$) — the length of array $a$. It is guaranteed that the sum of values of $n$ over all test cases in the input does not exceed $10^{5}$. 36 37 The second line of each test case contains $n$ integers $a_{1}, a_{2}, \ldots, a_{n}$ ($-10^{9} \le a_{i} \le 10^{9}$). 38 39 Output 40 41 For each test case, print the minimum number of seconds in which you can make $a$ nondecreasing. 42 43 Example 44 45 Input 46 47 ``` 48 3 49 50 4 51 52 1 7 6 5 53 54 5 55 56 1 2 3 4 5 57 58 2 59 60 0 -4 61 ``` 62 63 Output 64 65 ``` 66 2 67 0 68 3 69 ``` 70 71 Note 72 73 In the first test case, if you select indices $3, 4$ at the $1$-st second and $4$ at the $2$-nd second, then $a$ will become $[1, 7, 7, 8]$. There are some other possible ways to make $a$ nondecreasing in $2$ seconds, but you can't do it faster. 74 75 In the second test case, $a$ is already nondecreasing, so answer is $0$. 76 77 In the third test case, if you do nothing at first $2$ seconds and select index $2$ at the $3$-rd second, $a$ will become $[0, 0]$.