#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  if (t == EOF) return false;
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
  return true;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
const int maxn = 300111;
int n, a[maxn], lv[maxn], rv[maxn], dp[maxn];
void solve() {
  get_int(n);
  for (int i = 1; i <= n; i++) get_int(a[i]);
  for (int i = 1; i <= n; i++) lv[i] = rv[i] = 0;
  for (int i = 1; i <= n; i++) {
    if (!lv[a[i]]) lv[a[i]] = i;
    rv[a[i]] = i;
  }
  int cnt = 0, mx = 0, last = 0;
  for (int i = 1; i <= n; i++)
    if (lv[i]) {
      cnt++;
      if (last && rv[last] < lv[i])
        dp[i] = dp[last] + 1;
      else
        dp[i] = 1;
      mx = max(mx, dp[i]);
      last = i;
    }
  printf("%d\n", cnt - mx);
}
int main() {
  int tc;
  get_int(tc);
  while (tc--) solve();
  return 0;
}
