#P14788. [NERC 2025] Greta' s Game

    ID: 16615 远端评测题 3000ms 1024MiB 尝试: 0 已通过: 0 难度: 7 上传者: 标签>动态规划 DP数学二分2025ICPCNERC/NEERC

[NERC 2025] Greta' s Game

题目描述

Greta and Alice are the two permanent hosts of the hit comedy show “QuestExpert”. For this season they invited nn programmers to complete quests, set by Alice. After that they all meet in a studio to review how well they did and complete the final studio quest.

Today, the studio quest that Alice came up with is as follows: first, all nn participants stand in a circle in order from 1 to nn counter-clockwise. Then Alice holds some number of rounds. In each round, every participant writes down an integer on a piece of paper. After that, Alice checks the numbers and for each ii from 1 to nn, if the ii-th participant’s number is strictly larger than the number of the next participant in counter-clockwise order (participant number (imodn)+1(i \bmod n) + 1), then the ii-th and the (imodn)+1(i \bmod n) + 1-st participants both receive one point. After all rounds are complete, Alice calculates the total number of points for each participant and reports them to Greta. It turned out that the ii-th participant scored aia_i points.

Greta thinks that math games are boring, and this one took too long. To prove her wrong, Alice decides to cheat a little and instead of telling Greta the real number of rounds, she will tell her the minimum possible number of rounds that could still result in the ii-th participant scoring aia_i points for each ii.

Help Alice determine this number.

输入格式

Each test contains multiple test cases. The first line contains the number of test cases tt (1t1041 \le t \le 10^4). The description of the test cases follows.

The first line of each test case contains a single integer nn, denoting the number of participants (2n51052 \le n \le 5 \cdot 10^5).

The second line contains nn integers a1,a2,,ana_1, a_2, \dots, a_n, denoting the final scores of the participants (0ai1090 \le a_i \le 10^9). It is guaranteed that those scores were achieved in the described game with at least one round.

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

输出格式

For each test case, output on a separate line the minimum number of rounds that could lead to the given scores.

5
2
3 3
3
2 2 2
4
1 2 4 3
5
0 2 3 5 4
6
5 8 3 10 14 4
3
2
2
4
10