#include<bits/stdc++.h>
using namespace std;
int n,i,l,r,t,ans,a[1000010];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
l=1;
r=1;
ans=0;
set<int>s;
while(r<=n){
while(r<=n&&s.count(a[r])==0)s.insert(a[r++]);
ans=max(ans,r-l);
s.erase(a[l++]);
}
printf("%d\n",ans);
}
return 0;
}
UVA 11572 Unique Snowflakes
最新推荐文章于 2021-07-01 11:41:40 发布