fork download
  1. #include<bits/stdc++.h>
  2. #define TIME (1.0* clock()/CLOCKS_PER_SEC)
  3. #define pb push_back
  4. #define eb emplace_back
  5. #define id1 (id<<1)
  6. #define id2 (id<<1)|1
  7. #define ll long long
  8. #define ii pair<int,int>
  9. #define vi vector<int>
  10. #define vii vector<pair<int,int>>
  11. #define vl vector<long long>
  12. #define vll vector <pair<ll,ll>>
  13. #define li pair<long long,int>
  14. #define vil vector <pair<int,ll>>
  15. #define db double
  16. #define ff first
  17. #define ss second
  18. #define lb lower_bound
  19. #define ub upper_bound
  20. #define FOR(i, a, b) for (int i = (a); i <=(b); i++)
  21. #define F0R(i, a) FOR(i, 0, a-1)
  22. #define ROF(i, a, b) for (int i = (b); i >= (a); i--)
  23. #define R0F(i, a) ROF(i, 0, a-1)
  24. #define rep(a) F0R(_, a)
  25. #define each(a, x) for (auto &a : x)
  26. #define ALL(x) (x).begin(),(x).end()
  27. #define pq priority_queue <li, vector <li>, greater <li>>
  28. using namespace std;
  29. const int maxn=1e6;
  30. //const int MOD=1e9+7;
  31. //const int MOD=998244353;
  32. //const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};
  33.  
  34. int LIS(vi &a) {
  35. vi tail;
  36. for (int x : a) {
  37. auto it = lb(ALL(tail), x);
  38. if (it == tail.end()) tail.pb(x);
  39. else *it = x;
  40. }
  41. return tail.size();
  42. }
  43.  
  44. void solve(){
  45. int n;
  46. cin >> n;
  47. vi a(n);
  48. each(x, a) cin >> x;
  49. cout <<n- LIS(a) << "\n";
  50. }
  51.  
  52. signed main(){
  53. ios_base::sync_with_stdio(false);
  54. cin.tie(NULL);cout.tie(NULL);
  55. if (fopen("TASK.INP", "r")){
  56. freopen("TASK.INP", "r", stdin);
  57. freopen("TASK.OUT", "w", stdout);
  58. }
  59. int ntest;
  60. ntest=1;
  61. cin>>ntest;
  62.  
  63. for(int i=1;i<=ntest;i++) solve();
  64. cerr<<"\n"<<"Time elapsed "<<TIME<<"s.\n";
  65. return 0;
  66. }
Success #stdin #stdout #stderr 0s 5324KB
stdin
4
5
4 7 2 3 9
5
3 5 8 1 7
5
1 4 5 7 12
4
0 2 1 3
stdout
2
2
0
1
stderr
Time elapsed 0.004552s.