#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 1e16;
const int MAX = 4e5 + 5;
const int MOD = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline void read(T &num) {
  bool start = false, neg = false;
  char c;
  num = 0;
  while ((c = getchar()) != EOF) {
    if (c == '-')
      start = neg = true;
    else if (c >= '0' && c <= '9') {
      start = true;
      num = num * 10 + c - '0';
    } else if (start)
      break;
  }
  if (neg) num = -num;
}
inline long long powMM(long long a, long long b, long long M) {
  long long ret = 1;
  a %= M;
  while (b) {
    if (b & 1) ret = 1LL * ret * a % M;
    b >>= 1;
    a = 1LL * a * a % M;
  }
  return ret;
}
namespace {
template <class T>
inline int add(int x, T y) {
  x += y;
  if (x >= MOD) x -= MOD;
  return x;
}
template <class T>
inline void addi(int &x, T y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
template <class T>
inline int mul(int x, T y) {
  return 1LL * x * y % MOD;
}
template <class T>
inline void muli(int &x, T y) {
  x = 1LL * x * y % MOD;
}
template <class T>
inline int sub(int x, T y) {
  int res = x - y;
  if (res < 0) res += MOD;
  return res;
}
template <class T>
inline void subi(int &x, T y) {
  x -= y;
  if (x < 0) x += MOD;
  x %= MOD;
}
template <class T>
inline int half(int x) {
  return x & 1 ? (x + MOD) >> 1 : x >> 1;
}
}  // namespace
int l[MAX], r[MAX];
int q, n, m;
int stk[MAX], top;
int main() {
  read(q);
  while (q--) {
    read(n);
    m = 0;
    for (int i = 1; i <= n; i++) l[i] = r[i] = -1;
    for (int i = 1; i <= n; i++) {
      int u;
      read(u);
      if (l[u] == -1) l[u] = i, ++m;
      r[u] = i;
    }
    int an = m, top = 0;
    for (int i = 1; i <= n; i++) {
      if (l[i] == -1) continue;
      if (top && r[stk[top]] > l[i]) top = 0;
      stk[++top] = i;
      an = min(an, m - top);
    }
    printf("%d\n", an);
  }
  return 0;
}
