存code

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = ;
#define LL long long
int T,n,m,head1,head2,tail1,tail2;
int a[maxn];
int q1[maxn][],q2[maxn][];LL ans;
inline int read() {
    int x=;
    char c=getchar();
    while(c>''||c<'')c=getchar();
    while(c>=''&&c<='')x=x*x+c-'',c=getchar();
    return x;
}
int main() {
    T=read();
    while(T--) {
        n=read();
        for(int i=;i<=n;i++)a[i]=read();
        for(int k=;k<=n;k++)
        {
            ans=;int l=;
            head1=head2=;tail1=tail2=;
            memset(q1,,sizeof(q1));
            memset(q2,,sizeof(q2));
            for(int i=;i<=n;i++)
            {
                while(head1<=tail1&&q1[tail1][]>=a[i]) tail1--;
                tail1++;
                q1[tail1][]=a[i],q1[tail1][]=i;
                while(head2<=tail2&&q2[tail2][]<=a[i]) tail2--;
                tail2++;
                q2[tail2][]=a[i],q2[tail2][]=i;
                while(head1<=tail1 && head2<=tail2&&q2[head2][]-q1[head1][]>=k) {
                    l=min(q2[head2][],q1[head1][])+;
                    if(q2[head2][]<q1[head1][]) {
                        head2++;
                    } else if(q2[head2][]>q1[head1][]) {
                        head1++;
                    } else {
                        head1++;head2++;
                    }
                }
                ans+=i-l+;
            }
            printf("%lld\n",ans);
        }
    }
    return ;
}