1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
#include <algorithm>
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define pb push_back
#define EB emplace_back
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define SZ(a) ((long long) a.size())
#define FOR(i, a, b) for (long long i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (long long i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
#define fsp(x) fixed<<setprecision(x)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;
using vpll = vector<pll>;using vtll = vector<tll>;
using vdb = vector<DB>;using vc=vector<char>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
static constexpr ll MAXN=(ll)1e6+10,INF=(ll)1e17+9;
static constexpr ll mod=(ll)1e9+7;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,T,lT;
inline void __();
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>lT;
while(lT--)
__();
return 0;
}
struct RMQ{
using ll = long long;
ll n;vector<ll> tr;bool ismax;vector<ll> origin;
inline ll lowbit(const ll &x){
return x&-x;
}
private:
ll get(const ll &a,const ll &b){
if(ismax){
return max(a,b);
}else{
return min(a,b);
}
}
ll set(){
if(ismax) return -INF;
else return INF;
}
public:
RMQ(ll n,bool ismax=true){
this->n=n;this->ismax=ismax;
if(ismax) tr.resize(n+5,-INF),origin.resize(n+5);
else tr.resize(n+5,INF),origin.resize(n+5);
}
ll query(ll l,ll r){
ll res=set();
while (r>=l) {
res=get(origin[r],res);
r--;
for(;r-lowbit(r)>=l;r-=lowbit(r)){
res=get(res, tr[r]);
}
}
return res;
}
void upd(ll p,ll x){
origin[p]=x;
for(int i=p;i<=n;i+=lowbit(i)){
tr[i]=origin[i];
for(int j=1;j<lowbit(i);j<<=1){
tr[i]=get(tr[i],tr[i-j]);
}
}
}
};
inline void __(){
cin>>N;
vll A(N),pos(N+5);
FOR(i,1,N){
cin>>A[i-1];
pos[A[i-1]]=i-1;
}
if(N==1){
cout<<0<<"\n";
return;
}
RMQ tr(N);
vb vis(N+5);
FOR(i,1,N){
ll val=A[i-1];
vis[val]=true;
ll res=tr.query(1, val-1);
if(res==-INF) res=0;
ll lans=tr.origin[val-1]+vis[val-1]+(val==1 || val==N);
lans=max(lans,res+(val==1 || val==N));
tr.upd(val, lans);
}
ll ans=tr.query(1, N);
#ifdef LOCAL
FOR(i,1,N){
cerr<<tr.origin[i]<<" ";
}
cend;
#endif
ans=N+1-ans;
cout<<ans<<"\n";
}
|