# |
Author |
Problem |
Lang |
Verdict |
Time |
Memory |
Sent |
Judged |
|
190339025 |
Contestant:
baiABC |
1792C
- 7
|
C++14 (GCC 6-32)
|
Accepted
|
61 ms
|
2356 KB
|
2023-01-24 17:55:30 |
2023-01-25 12:23:00 |
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
int T = 1; cin >> T;
while(T--)
{
int n; cin >>n;
vector <int> p(n+1), d(n+1), pos(n+1);
for(int i=1;i<=n;++i) cin >>p[i],pos[p[i]]=i;
if(n==1){cout<<0<<'\n';continue;}
for(int i=1;i<=n;++i)
d[p[i]] = d[p[i]-1]+1;
int ans= 0;
for(int i=n/2;i>=1;--i)
if(d[n+1-i]<(n+1-i)-i+1)
++ans;
cout<<ans<<'\n';
}
return 0;
}
Click to see test details