2026/7/20 ZJCPC2026

include

include

include

include

include

include

include

include

include

include

include

include<bits/stdc++.h>

define int long long

define fi first

define se second

define mkp make_pair

define pii pair<int,int>

using namespace std;
const int Mx=500005,p=998244353;
int read(){
int Alice=0,Aya=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch'-') Aya=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
Alice=(Alice<<3)+(Alice<<1)+(ch^48);
ch=getchar();
}
return (Aya1?Alice:-Alice);
}
int n;
int a[Mx];
int f[Mx],g[Mx];
struct BIT{
int t[Mx];
void Init(){
for(int i=0;i<=n;i++) t[i]=0;
}
void ChkMax(int i,int k){
for(;i<=n;i+=i&-i) t[i]=max(t[i],k);
}
int Qry(int i){
int res=0;
for(;i;i&=(i-1)) res=max(res,t[i]);
return res;
}
}I,D;
struct BITS{
int t[Mx];
void Init(){
for(int i=0;i<=n;i++) t[i]=0;
}
void Add(int i,int k){
if(i==0) return;
for(;i<=n;i+=i&-i) t[i]+=k;
}
int Qry(int i){
int res=0;
for(;i;i&=(i-1)) res+=t[i];
return res;
}
}C;
int pre[Mx],suf[Mx];
sets;
int Calc(){
pre[0]=0;
for(int i=1;i<=n;i++){
pre[i]=max(pre[i-1],f[i]);
}
int res=0;
for(int i:s){
res+=pre[i];
}
return res;
}
int mxv[Mx],mnv[Mx];
void Solve(){
n=read();
I.Init(),D.Init(),C.Init();
for(int i=1;i<=n;i++) f[i]=0,g[i]=0,mxv[i]=0,mnv[i]=n+1;
for(int i=1;i<=n;i++) a[i]=read();
int LIS=0,LDS=0;
s.clear();
for(int i=1;i<=n;i++) s.insert(0);
int res=0;
for(int i=1;i<=n;i++){
f[a[i]]=I.Qry(a[i])+1;
g[a[i]]=D.Qry(n-a[i]+1)+1;
int v=mxv[g[a[i]]];
int u=mnv[f[a[i]]];
if(u>a[i]){
res+=C.Qry(u-1);
u=mnv[f[a[i]]]=a[i];
res-=C.Qry(u-1);
}
if(v<a[i]){
res-=upper_bound(mnv+1,mnv+n+1,v)-mnv-1;
s.erase(v);
C.Add(v,-1);
v=mxv[g[a[i]]]=a[i];
res+=upper_bound(mnv+1,mnv+n+1,v)-mnv-1;
s.insert(v);
C.Add(v,+1);
}
LIS=max(LIS,f[a[i]]);
LDS=max(LDS,g[a[i]]);
I.ChkMax(a[i],f[a[i]]);
D.ChkMax(n-a[i]+1,g[a[i]]);
//Calc();
printf("%lld ",LISLDS-res);
}
puts("");
// for(int i=1;i<=n;i++){
// cout<<f[i]<<" "<<g[i]<<endl;
// }
}
signed main(){
int T=read();
while(T--) Solve();
return 0;
}
/
Hello!!
Sample:

---

*/