#include <iostream>
#include <cstdio>
#include <string>
#include <sstream> 
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <cassert>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define DBG cerr << "debug here" << endl;
#define DBGV(vari) cerr << #vari<< " = "<< (vari) <<endl;

typedef long long ll;
const int INF = 1e9;

int main()
{
    ios_base::sync_with_stdio(0);
    int t;
    cin >> t;
    for (int tid = 1; tid <= t; ++tid) {
        int n;
        cin >> n;
        vector<int> a(n+1);
        for (int i = 1; i <= n; ++i) {
            cin >> a[i];
        }

        ll sum = 0;
        for (int i = 1; i <= n; ++i) {
            sum += a[i];
        }

        int lo = 1;
        int hi = n;
        ll res = 1e18;
        while (lo <= hi) {
            ll m = (lo+hi)/2;
            //cout << "binsearch with " << lo << " " << hi << " " << m << endl;
            ll len = 2*m-1;
            if (len > n) {
                hi = m-1;
            } else {
                vector<bool> L(n+1);
                vector<bool> R(n+1);
                int cur = 0;
                for (int i = 1; i <= n; ++i) {
                    if (a[i] >= cur+1) {
                        ++cur;
                        if (cur == m) {
                            L[i] = true;
                            //cout << "mamy " << m << " na lewo od " << i << endl;
                            --cur;
                        }
                    } else {
                        cur = a[i];
                    }
                }
                cur = 0;
                for (int i = n; i >= 0; --i) {
                    if (a[i] >= cur+1) {
                        ++cur;
                        if (cur == m) {
                            R[i] = true;
                            //cout << "mamy " << m << " na prawo od " << i << endl;
                            --cur;
                        }
                    } else {
                        cur = a[i];
                    }
                }
                bool found = false;
                for (int i = 1; i < n; ++i) {
                    if (L[i] && R[i]) {
                        found = true;
                        break;
                    }
                }
                if (found) {
                    //cout << "yeah found peak = " << m << endl;
                    ll cost = sum - (m*(m+1)-m);
                    REMIN(res, cost);
                    lo = m+1;
                } else {
                    hi = m-1;
                }
            }
        }
        cout << res << endl;
    }
    return 0;
}