#include <bits/stdc++.h>
using namespace std;
const long double EPS = (long double)1e-7;
const long double PI = acos(0) * 2;
bool isZero(const long double& x) { return abs(x) <= EPS; }
int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
long long gcd(long long a, long long b) {
  for (; b; a %= b, swap(a, b)) {
  }
  return abs(a);
}
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
pair<long long, long long> operator*(const pair<long long, long long>& a,
                                     const long long& b) {
  return pair<long long, long long>(a.first * b, a.second * b);
}
long long operator*(const pair<long long, long long>& a,
                    const pair<long long, long long>& b) {
  return a.first * b.second - b.first * a.second;
}
long long ccw(const pair<long long, long long>& a,
              const pair<long long, long long>& b,
              const pair<long long, long long>& c) {
  return a * b + b * c + c * a;
}
void fg(vector<int> G[], int a, int b) {
  G[a].emplace_back(b);
  G[b].emplace_back(a);
}
void fg(vector<pair<int, int> > G[], int a, int b, int c) {
  G[a].emplace_back(b, c);
  G[b].emplace_back(a, c);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
const int MAXN = 300055;
struct BIT {
  int d[MAXN];
  void init(int x) {
    for (x += 5; x < MAXN; x += ((x) & (-(x)))) d[x] = 0;
  }
  void upd(int x, int r) {
    for (x += 5; x < MAXN; x += ((x) & (-(x)))) (d[x]) = max((d[x]), (r));
  }
  int get(int x) {
    int r = 0;
    for (x += 5; x; x -= ((x) & (-(x)))) (r) = max((r), (d[x]));
    return r;
  }
} bit;
int dp[MAXN];
int B[MAXN], C[MAXN];
int A[MAXN];
int T, N, K, Ans;
void run() {
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> A[i];
  {
    vector<int> V;
    for (int i = 1; i <= N; i++) V.emplace_back(A[i]);
    sort(((V).begin()), ((V).end()));
    (V).erase(unique(((V).begin()), ((V).end())), (V).end());
    for (int i = 1; i <= N; i++)
      A[i] = int(lower_bound(((V).begin()), ((V).end()), A[i]) - V.begin()) + 1;
    K = ((int)(V).size());
  }
  fill(B, B + N + 1, (0x3f3f3f3f));
  fill(C, C + N + 1, -1);
  for (int i = 1; i <= N; i++) {
    (B[A[i]]) = min((B[A[i]]), (i));
    (C[A[i]]) = max((C[A[i]]), (i));
  }
  Ans = 0;
  vector<int> XV;
  C[0] = 0;
  for (int x = 1; x <= K; x++) {
    dp[x] = 1;
    if (C[x - 1] < B[x]) (dp[x]) = max((dp[x]), (dp[x - 1] + 1));
    (Ans) = max((Ans), (dp[x]));
  }
  cout << K - Ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  for (cin >> T; T--;) run();
  return 0;
}
