CF1591B.Array Eversion

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given an array aa of length nn .

Let's define the eversion operation. Let x=anx = a_n . Then array aa is partitioned into two parts: left and right. The left part contains the elements of aa that are not greater than xx ( x\le x ). The right part contains the elements of aa that are strictly greater than xx ( >x> x ). The order of elements in each part is kept the same as before the operation, i. e. the partition is stable. Then the array is replaced with the concatenation of the left and the right parts.

For example, if the array aa is [2,4,1,5,3][2, 4, 1, 5, 3] , the eversion goes like this: [2,4,1,5,3][2,1,3],[4,5][2,1,3,4,5][2, 4, 1, 5, 3] \to [2, 1, 3], [4, 5] \to [2, 1, 3, 4, 5] .

We start with the array aa and perform eversions on this array. We can prove that after several eversions the array aa stops changing. Output the minimum number kk such that the array stops changing after kk eversions.

输入格式

Each test contains multiple test cases. The first line contains the number of test cases tt ( 1t1001 \le t \le 100 ). Description of the test cases follows.

The first line contains a single integer nn ( 1n21051 \le n \le 2 \cdot 10^5 ).

The second line contains nn integers a1,a2,,ana_1, a_2, \dots, a_n ( 1ai1091 \le a_i \le 10^9 ).

It is guaranteed that the sum of nn over all test cases does not exceed 21052 \cdot 10^5 .

输出格式

For each test case print a single integer kk — the number of eversions after which the array stops changing.

输入输出样例

  • 输入#1

    3
    5
    2 4 1 5 3
    5
    5 3 2 4 1
    4
    1 1 1 1

    输出#1

    1
    2
    0

说明/提示

Consider the fist example.

  • The first eversion: a=[1,4,2,5,3]a = [1, 4, 2, 5, 3] , x=3x = 3 . [2,4,1,5,3][2,1,3],[4,5][2,1,3,4,5][2, 4, 1, 5, 3] \to [2, 1, 3], [4, 5] \to [2, 1, 3, 4, 5] .
  • The second and following eversions: a=[2,1,3,4,5]a = [2, 1, 3, 4, 5] , x=5x = 5 . [2,1,3,4,5][2,1,3,4,5],[][2,1,3,4,5][2, 1, 3, 4, 5] \to [2, 1, 3, 4, 5], [] \to [2, 1, 3, 4, 5] . This eversion does not change the array, so the answer is 11 .

Consider the second example.

  • The first eversion: a=[5,3,2,4,1]a = [5, 3, 2, 4, 1] , x=1x = 1 . [5,3,2,4,1][1],[5,3,2,4][1,5,3,2,4][5, 3, 2, 4, 1] \to [1], [5, 3, 2, 4] \to [1, 5, 3, 2, 4] .
  • The second eversion: a=[1,5,3,2,4]a = [1, 5, 3, 2, 4] , x=4x = 4 . [1,5,3,2,4][1,3,2,4],[5][1,3,2,4,5][1, 5, 3, 2, 4] \to [1, 3, 2, 4], [5] \to [1, 3, 2, 4, 5] .
  • The third and following eversions: a=[1,3,2,4,5]a = [1, 3, 2, 4, 5] , x=5x = 5 . [1,3,2,4,5][1,3,2,4,5],[][1,3,2,4,5][1, 3, 2, 4, 5] \to [1, 3, 2, 4, 5], [] \to [1, 3, 2, 4, 5] . This eversion does not change the array, so the answer is 22 .
首页