CF1692H.Gambling

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Marian is at a casino. The game at the casino works like this.

Before each round, the player selects a number between 11 and 10910^9 . After that, a dice with 10910^9 faces is rolled so that a random number between 11 and 10910^9 appears. If the player guesses the number correctly their total money is doubled, else their total money is halved.

Marian predicted the future and knows all the numbers x1,x2,,xnx_1, x_2, \dots, x_n that the dice will show in the next nn rounds.

He will pick three integers aa , ll and rr ( lrl \leq r ). He will play rl+1r-l+1 rounds (rounds between ll and rr inclusive). In each of these rounds, he will guess the same number aa . At the start (before the round ll ) he has 11 dollar.

Marian asks you to determine the integers aa , ll and rr ( 1a1091 \leq a \leq 10^9 , 1lrn1 \leq l \leq r \leq n ) such that he makes the most money at the end.

Note that during halving and multiplying there is no rounding and there are no precision errors. So, for example during a game, Marian could have money equal to 11024\dfrac{1}{1024} , 1128\dfrac{1}{128} , 12\dfrac{1}{2} , 11 , 22 , 44 , etc. (any value of 2t2^t , where tt is an integer of any sign).

输入格式

The first line contains a single integer tt ( 1t1001 \leq t \leq 100 ) — the number of test cases.

The first line of each test case contains a single integer nn ( 1n21051 \leq n \leq 2\cdot 10^5 ) — the number of rounds.

The second line of each test case contains nn integers x1,x2,,xnx_1, x_2, \dots, x_n ( 1xi1091 \leq x_i \leq 10^9 ), where xix_i is the number that will fall on the dice in the ii -th round.

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

输出格式

For each test case, output three integers aa , ll , and rr such that Marian makes the most amount of money gambling with his strategy. If there are multiple answers, you may output any of them.

输入输出样例

  • 输入#1

    4
    5
    4 4 3 4 4
    5
    11 1 11 1 11
    1
    1000000000
    10
    8 8 8 9 9 6 6 9 6 6

    输出#1

    4 1 5
    1 2 2
    1000000000 1 1
    6 6 10

说明/提示

For the first test case, the best choice is a=4a=4 , l=1l=1 , r=5r=5 , and the game would go as follows.

  • Marian starts with one dollar.
  • After the first round, he ends up with 22 dollars because the numbers coincide with the chosen one.
  • After the second round, he ends up with 44 dollars because the numbers coincide again.
  • After the third round, he ends up with 22 dollars because he guesses 44 even though 33 is the correct choice.
  • After the fourth round, he ends up with 44 dollars again.
  • In the final round, he ends up 88 dollars because he again guessed correctly.

There are many possible answers for the second test case, but it can be proven that Marian will not end up with more than 22 dollars, so any choice with l=rl = r with the appropriate aa is acceptable.

首页