#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);
for (int i = 0; i < n; i++) cin >> a[i];
long long baseSum = accumulate(a.begin(), a.end(), 0LL);
long long bestGain = 0;
for (int i = 0; i < n; i++) {
long long sum1 = 0;
for (int j = i; j < n; j++) {
if (a[j] >= (i + j + 2)) break;
sum1 += a[j];
long long newSum = 1LL * (j - i + 1) * (i + j + 2);
long long gain = newSum - sum1;
bestGain = max(bestGain, gain);
}
}
cout << baseSum + bestGain << "\n";
}
int32_t main() {
fast_io;
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpCiNkZWZpbmUgaW50IGxvbmcgbG9uZwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSBjaW4gPj4gYVtpXTsKCiAgICBsb25nIGxvbmcgYmFzZVN1bSA9IGFjY3VtdWxhdGUoYS5iZWdpbigpLCBhLmVuZCgpLCAwTEwpOwoKICAgIGxvbmcgbG9uZyBiZXN0R2FpbiA9IDA7CgogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBsb25nIGxvbmcgc3VtMSA9IDA7CgogICAgICAgIGZvciAoaW50IGogPSBpOyBqIDwgbjsgaisrKSB7CgogICAgICAgICAgICBpZiAoYVtqXSA+PSAoaSArIGogKyAyKSkgYnJlYWs7CgogICAgICAgICAgICBzdW0xICs9IGFbal07CgogICAgICAgICAgICBsb25nIGxvbmcgbmV3U3VtID0gMUxMICogKGogLSBpICsgMSkgKiAoaSArIGogKyAyKTsKICAgICAgICAgICAgbG9uZyBsb25nIGdhaW4gPSBuZXdTdW0gLSBzdW0xOwoKICAgICAgICAgICAgYmVzdEdhaW4gPSBtYXgoYmVzdEdhaW4sIGdhaW4pOwogICAgICAgIH0KICAgIH0KCiAgICBjb3V0IDw8IGJhc2VTdW0gKyBiZXN0R2FpbiA8PCAiXG4iOwp9CgppbnQzMl90IG1haW4oKSB7CiAgICBmYXN0X2lvOwogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQo=