1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <cstdio>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define REPD(i,n) FORD(i,0,n)
#define INT(x) int x; scanf("%d", &x)

typedef long long LL;

int a[200000];
LL b[200000], sl[200001], sr[200001];
LL c[200000];

void test() {
	INT(n);
	REP(i,n) scanf("%d", &a[i]);
	REP(i,n) b[i] = !!a[i];
	sl[0] = 0;
	REP(i,n) sl[i + 1] = sl[i] + b[i];
	sr[n] = 0;
	REPD(i,n) sr[i] = sr[i + 1] + b[i];
	REP(i,n) c[i] = sl[i] * b[i] * sr[i + 1] + (b[i] * (b[i] - 1) >> 1) * (sl[i] + sr[i + 1]) + (b[i] * (b[i] - 1) * (b[i] - 2) / 6);
	int k = 0;
	REP(i,n) if (a[i] - c[i] > a[k] - c[k]) k = i;
	while (a[k] > c[k]) {
		++b[k];
		sl[0] = 0;
		REP(i,n) sl[i + 1] = sl[i] + b[i];
		sr[n] = 0;
		REPD(i,n) sr[i] = sr[i + 1] + b[i];
		REP(i,n) c[i] = sl[i] * b[i] * sr[i + 1] + (b[i] * (b[i] - 1) >> 1) * (sl[i] + sr[i + 1]) + (b[i] * (b[i] - 1) * (b[i] - 2) / 6);
		k = 0;
		REP(i,n) if (a[i] - c[i] > a[k] - c[k]) k = i;
	}
	LL s = 0;
	REP(i,n) s += b[i];
	printf("%lld\n", s);
}

int main() {
	INT(t);
	REP(tt,t) test();
}