#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);
vector<int> pref(n+1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = pref[i-1] + a[i];
}
int original_sum = pref[n];
int best = 0;
long long bestVal = LLONG_MAX;
for (int r = 1; r <= n; r++) {
long long cur = pref[r-1] - (1LL * r * (r + 1));
bestVal = min(bestVal, cur);
long long gain = 1LL * r * (r + 1) - pref[r] - bestVal;
best = max(best, gain);
}
cout << original_sum + best << "\n";
}
int32_t main() {
fast_io;
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpCiNkZWZpbmUgaW50IGxvbmcgbG9uZwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKzEpOwogICAgdmVjdG9yPGludD4gcHJlZihuKzEsIDApOwoKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgICAgIHByZWZbaV0gPSBwcmVmW2ktMV0gKyBhW2ldOwogICAgfQoKICAgIGludCBvcmlnaW5hbF9zdW0gPSBwcmVmW25dOwogICAgaW50IGJlc3QgPSAwOwoKICAgIGxvbmcgbG9uZyBiZXN0VmFsID0gTExPTkdfTUFYOwoKICAgIGZvciAoaW50IHIgPSAxOyByIDw9IG47IHIrKykgewoKICAgICAgICBsb25nIGxvbmcgY3VyID0gcHJlZltyLTFdIC0gKDFMTCAqIHIgKiAociArIDEpKTsKICAgICAgICBiZXN0VmFsID0gbWluKGJlc3RWYWwsIGN1cik7CgogICAgICAgIGxvbmcgbG9uZyBnYWluID0gMUxMICogciAqIChyICsgMSkgLSBwcmVmW3JdIC0gYmVzdFZhbDsKCiAgICAgICAgYmVzdCA9IG1heChiZXN0LCBnYWluKTsKICAgIH0KCiAgICBjb3V0IDw8IG9yaWdpbmFsX3N1bSArIGJlc3QgPDwgIlxuIjsKfQoKaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K