1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int a[N], tmp[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin >> t; while (t--) {
int n;
cin >> n;
memset(tmp, 0, sizeof(int) * (n + 1));
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll ans = 0;
int j = 0;
for (int i = 1; i <= n; i++) {
while (j < n && !tmp[a[j + 1]]) {
tmp[a[++j]]++;
}
ans = max(ans, j - i + 1ll);
tmp[a[i]]--;
}
cout << ans << '\n';
}
}
|