样例过了，WA

#include<bits/stdc++.h>
#define MAXN 1000009
using namespace std;
int T,n,a[MAXN],l=1,r=1,ans=-114514,repeat=0;//[l,r]
map<int,int> num;
int main(){
	scanf("%d",&T);
	while(T--){
		l=1;r=1;
		num.clear();
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		num[1]=1;
		while(l<=r&&r<=n){
			if(repeat==0){
				ans=max(ans,r-l+1);
				r++;
				if(++num[a[r]]>1) repeat++;
			}
			else{
				if(--num[a[l]]==1) repeat--;
				l++;
			}
		}
		printf("%d\n",ans);
	}
	
	
	return 0;
}