Defective Script

시간 제한2초메모리 제한2048 MB

요약
원형으로 배치된 서버 부하에서 한 서버를 고르면 그 서버는 2만큼, 이전 서버는 1만큼 줄어든다. 모든 서버를 같게 만들 수 있는 최대 부하를 구한다.
난이도

어려움10점 중 8점

유형
이분 탐색, 그리디, 누적 합, 배열
정답자
아직 제출이 없습니다

문제

Devin is a system administrator at a tech company that manages a network of nn servers arranged in a ring topology. Each server is handling a certain amount of computational load, represented by a non-negative integer a_ia\_i, where ii ranges from 11 to nn.

To optimize the network performance and ensure fairness, Devin wants to equalize the load across all servers, making each server handle the same amount of load. He aims to maximize this equal load as much as possible.

Devin has developed a script to reduce the load on any server. When he runs the script on server ii, it is supposed to decrease the load on that server by 22 units (down to a minimum of zero). However, due to a known bug in the script, every time it's executed on server ii, it inadvertently removes an additional 11 unit of load from the previous server in the network (server i−1i-1). If i=1i = 1, the previous server is server nn (since the servers form a ring).

Devin can run this buggy script any number of times (including zero), each time choosing any server to run it on. He can run the script on a server even if its current load is less than 22 units, or if the load of the previous server is zero (in both cases the load goes to zero).

Help Devin determine the maximum possible equal load that can be achieved on all servers using his script.

입력

Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1041 \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 servers (2≤n≤2⋅1052 \le n \le 2 \cdot 10^5).

The second line contains nn integers a_1,a_2,…,a_na\_1, a\_2, \ldots, a\_n, denoting the amounts of load the servers are handling (0≤a_i≤1090 \le a\_i \le 10^9).

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

출력

For each test case, print the maximum possible equal load that can be achieved on all servers.

힌트

In the first test case, Devin can run the script once on server 11, twice on server 22, and once on server 44. As a result, each server will be handling 55 units of load.

예제1

  1. 예제 1

    입력
    5
    4
    9 9 6 8
    2
    3 5
    9
    9 9 8 2 4 4 3 5 3
    3
    777 777 777
    6
    0 1 0 1 0 1
    
    예상 출력
    5
    1
    0
    777
    0