// luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rint register int
#define IL inline
#define rep(i,h,t) for (rint i=h;i<=t;i++)
#define dep(i,t,h) for (rint i=t;i>=h;i--)
#define me(x) memset(x,0,sizeof(x))
#define mid ((h+t)/2)
char ss[1<<24],*A=ss,*B=ss;
IL char gc()
{
  return A==B&&(B=(A=ss)+fread(ss,1,1<<24,stdin),A==B)?EOF:*A++; 
}
template<class T>IL void read(T &x)
{
  rint f=1,c; while (c=gc(),c<48||c>57) if (c==‘-‘) f=-1; x=(c^48);
  while (c=gc(),c>47&&c<58) x=(x<<3)+(x<<1)+(c^48); x*=f;
}
const int N=4e5+10;
const int N2=N*4;
int cnt;
struct re{
  int a,b,c,d;
}p[N*5];
int maxa[N2],lazy[N2],data[N2],a[N];
vector<int> ve[N];
IL void change(int h1,int t1,int h2,int t2,int k)
{
  p[++cnt].a=h1,p[cnt].b=h2,p[cnt].c=t2,p[cnt].d=k;
  p[++cnt].a=t1+1,p[cnt].b=h2,p[cnt].c=t2,p[cnt].d=-k;
}
IL bool cmp(re x,re y)
{
  return(x.a<y.a);
}
void build(int x,int h,int t)
{
  maxa[x]=0; data[x]=t-h+1; lazy[x]=0;
  if (h==t) return;
  build(x*2,h,mid); build(x*2+1,mid+1,t);
}
int cnt2=0;
void insert(int x,int h,int t,int h1,int t1,int k)
{
  if (h1>t1) return;
  if (h1<=h&&t<=t1)
  {
    maxa[x]+=k; lazy[x]+=k; return;
  }
  if (lazy[x])
  {
    maxa[x*2]+=lazy[x]; maxa[x*2+1]+=lazy[x];
    lazy[x*2]+=lazy[x]; lazy[x*2+1]+=lazy[x];
    lazy[x]=0;
  }
  if (h1<=mid) insert(x*2,h,mid,h1,t1,k);
  if (mid<t1) insert(x*2+1,mid+1,t,h1,t1,k);
  int t11=maxa[x*2],t22=maxa[x*2+1];
  if (t11<t22) maxa[x]=t22,data[x]=data[x*2+1];
  else if (t11>t22) maxa[x]=t11,data[x]=data[x*2];
  else maxa[x]=t11,data[x]=data[x*2+1]+data[x*2];
}
int main()
{
  int T,n;
  read(T);
  rep(ttt,1,T)
  {
    read(n);
    rep(i,1,n) ve[i].clear();
    int m=0;
    rep(i,1,n)
    {
      read(a[i]);
      m=max(a[i],m);
      ve[a[i]].push_back(i);
    }
    int k=m; cnt=0;
    rep(i,1,m)
    {
      if (!ve[i].size())
      { 
        k--; continue;
      }
      change(1,ve[i][0],ve[i][ve[i].size()-1],n,1);
      int tmp=(int)(ve[i].size())-2;
      rep(j,0,tmp)
        change(ve[i][j]+1,ve[i][j+1]-1,ve[i][j]+1,ve[i][j+1]-1,1);
      change(1,ve[i][0]-1,1,ve[i][0]-1,1);
      change(ve[i][ve[i].size()-1]+1,n,ve[i][ve[i].size()-1]+1,n,1);
    }
    rep(i,2,n)
    {
      change(i,i,1,i-1,-1);
    }
    sort(p+1,p+cnt+1,cmp);
    ll ans=0;
    build(1,1,n);
    rint j=1;
    rep(i,1,n)
    {
      while (j<=cnt&&p[j].a<=i) insert(1,1,n,p[j].b,p[j].c,p[j].d),j++;
      if (maxa[1]==k) ans+=data[1];
    }
    printf("%lld\n",ans);
  }
  return 0; 
}