#include <bits/stdc++.h>
using namespace std;
#define fast_io ios::sync_with_stdio(false); cin.tie(NULL)
#define int long long
void solve() {
int n;
cin >> n;
vector<int> a(n+1), pref(n+1,0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = pref[i-1] + a[i];
}
int original = pref[n];
int best_gain = 0;
long long bestB = LLONG_MAX;
for (int r = 1; r <= n; r++) {
long long B_r = 1LL*r*r - r - pref[r-1];
bestB = min(bestB, B_r);
long long A_r = 1LL*r*r + r - pref[r];
long long gain = A_r + bestB;
best_gain = max(best_gain, gain);
}
cout << original + best_gain << "\n";
}
int32_t main(){
fast_io;
int t;
cin >> t;
while(t--) solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpCiNkZWZpbmUgaW50IGxvbmcgbG9uZwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKzEpLCBwcmVmKG4rMSwwKTsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgICAgIHByZWZbaV0gPSBwcmVmW2ktMV0gKyBhW2ldOwogICAgfQoKICAgIGludCBvcmlnaW5hbCA9IHByZWZbbl07CiAgICBpbnQgYmVzdF9nYWluID0gMDsKCiAgICBsb25nIGxvbmcgYmVzdEIgPSBMTE9OR19NQVg7CgogICAgZm9yIChpbnQgciA9IDE7IHIgPD0gbjsgcisrKSB7CgogICAgICAgIGxvbmcgbG9uZyBCX3IgPSAxTEwqcipyIC0gciAtIHByZWZbci0xXTsKICAgICAgICBiZXN0QiA9IG1pbihiZXN0QiwgQl9yKTsKCiAgICAgICAgbG9uZyBsb25nIEFfciA9IDFMTCpyKnIgKyByIC0gcHJlZltyXTsKCiAgICAgICAgbG9uZyBsb25nIGdhaW4gPSBBX3IgKyBiZXN0QjsKCiAgICAgICAgYmVzdF9nYWluID0gbWF4KGJlc3RfZ2FpbiwgZ2Fpbik7CiAgICB9CgogICAgY291dCA8PCBvcmlnaW5hbCArIGJlc3RfZ2FpbiA8PCAiXG4iOwp9CgppbnQzMl90IG1haW4oKXsKICAgIGZhc3RfaW87CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUodC0tKSBzb2x2ZSgpOwp9Cg==