因为要求的好子数组是连续的，设 $d_i$ 表示以 $a_i$ 结尾的最长好数组的长度。当 $a_i \ge d_{i - 1} + 1$ 时，有 $d_i = d_{i - 1} + 1$。当 $a_i \lt d_{i - 1} + 1$ 时，注意到 $a_i \le d_{i - 1}$，并且以 $a_i$ 结尾的好数组的最大长度不能超过 $a_i$，这要求 $a_i$ 前面要有长度为 $a_i - 1$ 的好数组，此时恰好有 $a_i - 1 \lt a_i \le d_{i - 1}$，也就是 $a_i$ 前面必定有长度为 $a_i - 1$ 的好数组，所以此时 $d_i = a_i$。答案就是 $\sum_{i = 1}^n d_i$

// Date: Fri Dec 22 22:36:16 2023

#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
const int dir[8][2] = {
    {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
};

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;

const ull Pr = 131;

#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])

#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nonempty(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())

template <typename t> istream &operator>>(istream &in, vector<t> &vec) {
  for (t &x : vec)
    in >> x;
  return in;
}

template <typename t> ostream &operator<<(ostream &out, vector<t> &vec) {
  int n = SZ(vec);
  For(i, 0, n) {
    out << vec[i];
    if (i < n - 1)
      out << ' ';
  }
  return out;
}

#ifdef _DEBUG
#define debug1(x) cout << #x " = " << x << endl;
#define debug2(x, y) cout << #x " = " << x << " " #y " = " << y << endl;
#define debug3(x, y, z)                                                        \
  cout << #x " = " << x << " " #y " = " << y << " " #z " = " << z << endl;
#else
#define debug1
#define debug2
#define debug3
#endif

const int N = 200010;
int t, n, a[N], d[N];

int main(void) {
#ifdef _DEBUG
  freopen("1736c1.in", "r", stdin);
#endif
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  cin >> t;

  while (t--) {
    cin >> n;
    // TLE
    // memset(d, 0, sizeof d);
    For1(i, 1, n) cin >> a[i];
    ll res = 0;

    d[0] = 0;
    For1(i, 1, n) {
      if (a[i] >= d[i - 1] + 1) {
        d[i] = d[i - 1] + 1;
      } else {
        d[i] = a[i];
      }
      res += d[i];
    }
    cout << res << '\n';
  }

  return 0;
}