#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];
}
long long original = pref[n];
long long best_gain = 0;
long long bestB = LLONG_MIN;
for (int r = 1; r <= n; r++) {
long long B_r = pref[r-1] - 1LL*r*r + r;
bestB = max(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+IG47CgogICAgdmVjdG9yPGludD4gYShuKzEpLCBwcmVmKG4rMSwgMCk7CiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICBwcmVmW2ldID0gcHJlZltpLTFdICsgYVtpXTsKICAgIH0KCiAgICBsb25nIGxvbmcgb3JpZ2luYWwgPSBwcmVmW25dOwogICAgbG9uZyBsb25nIGJlc3RfZ2FpbiA9IDA7CgogICAgbG9uZyBsb25nIGJlc3RCID0gTExPTkdfTUlOOwoKICAgIGZvciAoaW50IHIgPSAxOyByIDw9IG47IHIrKykgewoKICAgICAgICBsb25nIGxvbmcgQl9yID0gcHJlZltyLTFdIC0gMUxMKnIqciArIHI7CiAgICAgICAgYmVzdEIgPSBtYXgoYmVzdEIsIEJfcik7CgogICAgICAgIGxvbmcgbG9uZyBBX3IgPSAxTEwqcipyICsgciAtIHByZWZbcl07CgogICAgICAgIGxvbmcgbG9uZyBnYWluID0gQV9yICsgYmVzdEI7CgogICAgICAgIGJlc3RfZ2FpbiA9IG1heChiZXN0X2dhaW4sIGdhaW4pOwogICAgfQoKICAgIGNvdXQgPDwgb3JpZ2luYWwgKyBiZXN0X2dhaW4gPDwgIlxuIjsKfQoKaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwp9Cg==