#include <bits/stdc++.h>
using namespace std;
const int NUM = 3e5 + 10;
const int inf = 0x3f3f3f3f;
const long long inf_ll = 0x3f3f3f3f3f3f3f3f;
int read() {
  int x = 0, v = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; v = (ch == '-') ? (-1) : (v), ch = getchar())
    ;
  for (; ch <= '9' && ch >= '0'; x = x * 10 + ch - '0', ch = getchar())
    ;
  return x * v;
}
vector<int> v;
int a[NUM], b[NUM];
int p[NUM];
int so[NUM], pos[NUM], fir[NUM], pos2[NUM], lst[NUM];
void init(int n) {
  for (int i = 0; i <= n; i++) {
    pos[i] = 0;
    pos2[i] = 0;
    p[i] = 0;
    b[i] = 0;
    fir[i] = inf;
    lst[i] = 0;
  }
  v.clear();
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    init(n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", a + i);
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i] != a[i - 1]) {
        b[++cnt] = a[i];
        p[cnt] = b[cnt];
      }
    }
    sort(p + 1, p + 1 + cnt);
    for (int i = 1; i <= cnt; i++) {
      if (p[i - 1] != p[i]) {
        v.push_back(p[i]);
      }
    }
    for (int i = 0; i < v.size(); i++) {
      pos[v[i]] = i + 1;
    }
    for (int i = 0; i <= cnt; i++) b[i] = pos[b[i]];
    for (int i = 1; i <= cnt; i++) {
      fir[b[i]] = min(i, fir[b[i]]);
      lst[b[i]] = max(i, lst[b[i]]);
    }
    int sum;
    sum = v.size();
    int l = 1, r = 1;
    int ans = 1, len = 1;
    int L = fir[1], R = lst[1];
    while (r <= sum) {
      if (fir[r + 1] > R) {
        R = lst[r + 1];
        r++;
      } else {
        L = fir[r + 1];
        R = lst[r + 1];
        l = r + 1;
        r = r + 1;
      }
      if (r <= sum) ans = max(ans, r - l + 1);
    }
    cout << sum - ans << endl;
  }
}
