#include <bits/stdc++.h>
using namespace std;
long long n, mx[400000], mn[400000];
long long seg[400000 * 4];
vector<long long> compress(vector<long long> x) {
  vector<long long> ans = x;
  vector<pair<long long, long long>> p;
  p.push_back({0, 0});
  for (long long i = 1; i < x.size(); i++) {
    p.push_back({x[i], i});
  }
  sort(p.begin(), p.end());
  ans[p[1].second] = 1;
  for (long long i = 2; i < p.size(); i++) {
    if (p[i].first > p[i - 1].first)
      ans[p[i].second] = ans[p[i - 1].second] + 1;
    else
      ans[p[i].second] = ans[p[i - 1].second];
  }
  return ans;
}
void update(long long pos, long long val, long long l1, long long r1,
            long long node) {
  if (l1 == r1) {
    seg[node] = val;
    return;
  }
  long long mid = (l1 + r1) / 2;
  if (pos <= mid) {
    update(pos, val, l1, mid, 2 * node);
  } else
    update(pos, val, mid + 1, r1, 2 * node + 1);
  seg[node] = max(seg[2 * node], seg[2 * node + 1]);
}
long long queri(long long l, long long r, long long l1, long long r1,
                long long node) {
  if (l1 > r or r1 < l) return 0;
  if (l <= l1 and r1 <= r) return seg[node];
  long long mid = (l1 + r1) / 2;
  return max(queri(l, r, l1, mid, 2 * node),
             queri(l, r, mid + 1, r1, 2 * node + 1));
}
void solv() {
  cin >> n;
  vector<long long> a(n + 1);
  set<long long> s;
  for (long long i = 1; i < n + 1; i++) {
    cin >> a[i];
    s.insert(a[i]);
    mx[i] = 0;
    mn[i] = 400000;
  }
  a = compress(a);
  for (long long i = 1; i < n + 1; i++) {
    mx[a[i]] = i;
    mn[a[i]] = min(mn[a[i]], i);
  }
  long long l = 1;
  long long len = 0;
  for (long long i = 1; i < s.size() + 1; i++) {
    update(i, mx[i], 1, n, 1);
  }
  for (long long i = 1; i < s.size() + 1; i++) {
    while (queri(l, i - 1, 1, n, 1) > mn[i] and l < i) l++;
    len = max(len, i - l + 1);
  }
  long long c = s.size();
  cout << c - len << '\n';
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  long long q;
  cin >> q;
  while (q--) solv();
}
