#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define all(x) (x).begin(), (x).end()
#define x first
#define y second
#define endl "\n" 
#define int long long
#define sz(x) ((int)(x).size())
#define lowbit(x) ((x) & -(x))
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,x,y) for(int i = x;i<y;i++)
#define reb(i,x,y) for(int i = x;i<=y;i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
typedef long double ld;
const int N = 2e5+10, M = 1e4 + 20, mod = 1e9+7 , inf = 0x7fffffff;;
const ld eps = 1e-12;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

int a[N];

bool check(int l, int r){
    for(int i = l;i<r;i++){
        if(a[i]!=a[i+1])return 0;
    }
    return 1;
}

int cnt(int l, int r){
    // cout<<l<<" "<<r<<endl;
    if(l>r)return 0;
    int maxx = a[l];
    int ans = r-l+1;
    for(int i = l;i<=r;i++){
        maxx = max(maxx,a[i]);
    }
    if(check(l,r))return ans;

    int idx, pre;
    if(a[l]==maxx){
        pre = l;
        idx = l+1;
    } else {
        pre = l-1;
        idx = l;
    }
    while(idx<r){
        if(a[idx]==maxx){
            ans+=cnt(pre+1,idx-1);
            pre = idx;
            idx = pre+1;
            continue;
        }
        idx++;
    }
    if(a[r]==maxx){
        ans+=cnt(pre+1,r-1);
    } else {
        ans+=cnt(pre+1,r);
    }
    return ans;
}

inline void solve() {
    memset(a,0,sizeof(a));
    int n;
    cin>>n;
    rep(i,0,n)cin>>a[i];
    int ans = cnt(0,n-1);
    cout<<ans-n<<endl;
}


signed main(){
    IOS;
    cout << fixed << setprecision(10);
    int __ = 1;
    cin>>__;
    while(__--) solve();
    return 0;
}