#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
void print_time() {}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
  return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class T>
ostream& operator<<(ostream& out, vector<T> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
template <class T>
ostream& operator<<(ostream& out, set<T> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
template <class L, class R>
ostream& operator<<(ostream& out, map<L, R> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  vector<long long> b(n);
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
    --a[i];
    b[i] = a[i];
  }
  sort((b).begin(), (b).end());
  vector<long long> nxt(n, -1);
  for (long long i = 0; i < n - 1; ++i) {
    if (b[i] < b[i + 1]) nxt[b[i]] = b[i + 1];
  }
  vector<long long> cnt(n);
  vector<long long> good(n - 1, true);
  for (long long i = 0; i < n; ++i) {
    long long kek = nxt[a[i]];
    if (kek >= 0) {
      if (cnt[kek]) {
        good[a[i]] = false;
      }
    }
    ++cnt[a[i]];
  }
  vector<long long> lol;
  for (long long i = 0; i < n; ++i) {
    if (cnt[i] && nxt[i] >= 0) {
      lol.push_back(good[i]);
    }
  }
  long long c = 0;
  for (long long i = 0; i < n; ++i) {
    if (cnt[i]) ++c;
  }
  long long ans = 0;
  long long k = 0;
  for (long long i = 0; i < ((int)(lol).size()); ++i) {
    if (lol[i]) {
      ++k;
    } else {
      k = 0;
    }
    ans = max(ans, k);
  }
  ++ans;
  cout << (c - ans) << "\n";
}
int main() {
  cout << fixed << setprecision(20);
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long q;
  cin >> q;
  while (q--) {
    solve();
  }
  print_time();
  return 0;
}
