http://codeforces.com/contest/1241/problem/D
#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>
#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int mod=1e9+7;
const int N=3e5+9;
int a[N],mp[N],dp[N],l[N],r[N];
int main()
{
FAST_IO;
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],mp[i]=a[i];
sort(mp+1,mp+1+n);
int len=unique(mp+1,mp+1+n)-mp-1;
for(int i=1;i<=n;i++) l[i]=INF,r[i]=-INF;
for(int i=1;i<=n;i++)
{
a[i]=lower_bound(mp+1,mp+1+len,a[i])-mp;
l[a[i]]=min(l[a[i]],i);
r[a[i]]=max(r[a[i]],i);
}
for(int i=1;i<=len;i++) dp[i]=1;
int ans=1;
for(int i=2;i<=len;i++)
{
//cout<<l[i]<<' '<<r[i]<<endl;
if(l[i]>r[i-1]) dp[i]=dp[i-1]+1;
ans=max(ans,dp[i]);
}
cout<<len-ans<<endl;
}
return 0;
}