P8547 - Multiply 2 Divide 2

内存限制：512 MB 时间限制：8 S

题面：传统评测方式：文本比较上传者：

提交：2 通过：1

Note:There is no dependency between this problem and problem Hack of Multiply 2 Divide 2.

Frank_DD has a sequence

of length

.
For each operation, he selects a number

a_{i} (1 \leq i \leq n)

and changes it to

⌊ \frac{a _{i}}{2} ⌋

.
Frank_DD wants to know the minimum number of operations to change the sequence

to a non-descending sequence.

The first line of the input contains one integer

T

(

1 \leq T \leq 5

)

--- the number of test cases. Then

T

test cases follow.

In each test case:
The first line contains a single integer

(1 \leq n \leq 1 0^{5})

--- the length of sequence

a

.
The second line contains

n

integers

a_{1}, a_{2}, \dots, a_{n}

(1 \leq a_{i} \leq 1 0^{5})

--- the sequence

a

For each test case, print a single integer in a single line --- the minimum number of operations to change the sequence

a

to a non-descending sequence.

2
7
6 3 3 4 10 8 2
10
9 9 4 7 3 10 10 8 4 3

4
11

8547: Multiply 2 Divide 2