#include <bits/stdc++.h>
using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
using ll = long long;

const int LG = 21;
const int MX = 200005;
vector<int> pos[MX];
int table[LG][MX];
int lg[MX];

void pre() {
  lg[1] = 0;
  for (int i = 2; i < MX; ++i) lg[i] = 1+lg[i>>1];
}

ll query(int l, int r) {
  int i = lg[r-l+1];
  return max(table[i][l], table[i][r-(1<<i)+1]);
}

ll solve(ll l, ll r) {
  if (l >= r) return 0;

  ll x, m, p, i, j, ans;
  x = query(l, r);
  j = lower_bound(pos[x].begin(), pos[x].end(), l) - pos[x].begin();
  m = pos[x].size();
  i = pos[x][j];
  ans = i-l + solve(l, i-1);
  for (j = j+1; j < m; ++j) {
    p = i;
    i = pos[x][j];
    ans += min(i, r) - p - 1 + solve(p+1, i-1);
    if (i >= r) break;
  }
  if (i < r) ans += solve(i+1, r);

  return ans;
}

template<typename T>
vector<T> normalize(vector<T>& a, T start = 0) {
  int n = a.size();
  vector<T> b = a;
  sort(b.begin(), b.end());
  b.erase(unique(b.begin(), b.end()), b.end());
  vector<T> ret(n, start);
  for (int i = 0; i < n; ++i) {
    ret[i] += lower_bound(b.begin(), b.end(), a[i]) - b.begin();
  }
  return ret;
}

int main() {
  FAST;
  pre();
  
  int tc = 1, ti;
  cin >> tc;

  for (ti = 1; ti <= tc; ++ti) {
    int n, i, j, k;
    cin >> n;

    vector<int> a(n);
    for (i = 0; i < n; ++i) cin >> a[i];
    a = normalize(a);
    for (i = 0; i < n; ++i) table[0][i] = a[i];
    for (j = 1; j <= lg[n]; ++j) {
      k = n-(1<<j);
      for (i = 0; i <= k; ++i) {
        table[j][i] = max(table[j-1][i], table[j-1][i+(1<<(j-1))]);
      }
    }

    for (i = 0; i < n; ++i) pos[i].clear();

    for (i = 0; i < n; ++i) {
      pos[a[i]].emplace_back(i);
    }

    cout << solve(0, n-1) << "\n";
  }

  return 0;
}