#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
mt19937 rng(steady_clock::now().time_since_epoch().count());
void usaco(string filename) {
#pragma message("be careful, freopen may be wrong")
  freopen((filename + ".in").c_str(), "r", stdin);
  freopen((filename + ".out").c_str(), "w", stdout);
}
const long long mod = 1000000009;
long long madd(long long a, long long b) { return (a + b) % mod; }
long long msub(long long a, long long b) {
  return (((a - b) % mod) + mod) % mod;
}
long long mmul(long long a, long long b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long mpow(long long base, long long exp) {
  long long res = 1;
  while (exp) {
    if (exp % 2 == 1) {
      res = (res * base) % mod;
    }
    exp >>= 1;
    base = (base * base) % mod;
  }
  return res;
}
long long minv(long long base) { return mpow(base, mod - 2); }
long long mdiv(long long a, long long b) { return mmul(a, minv(b)); }
long long gcd(long long x, long long y) {
  if (x == 0) return y;
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long n, m, k, q, Q, T, l, r, y, z;
long long a[500005];
long long b[500005];
string second, t;
long long ans = 0;
pair<long long, long long> loc[300005];
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  };
  cin >> Q;
  for (long long q = 0; q < Q; q++) {
    cin >> n;
    for (long long i = 0; i < n + 1; i++) {
      loc[i].first = 1e9;
      loc[i].second = -1;
    }
    set<int> cnt;
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      loc[a[i]].first = min(loc[a[i]].first, i);
      loc[a[i]].second = i;
      cnt.insert(a[i]);
    }
    long long run = 1;
    ans = 1;
    vector<int> ar(cnt.begin(), cnt.end());
    for (long long i = 1; i < ar.size(); i++) {
      if (loc[ar[i]].first > loc[ar[i - 1]].second)
        run++;
      else
        run = 1;
      ans = max(ans, run);
    }
    cout << ar.size() - ans << endl;
  }
}
