UVA11572UVA11572

#include<iostream>
#include<bitset>
#include<cstring>
using namespace std;
const int MAXN =1e6+114;
bitset<1000001145> b;


int T,n;
int ans;
int ls[MAXN];

int main(){
    cin>>T;
    while(T--){
        ans = -1;
        cin>>n;
        for(int i = 1;i<=n;i++) cin>>ls[i];

        for(int i = 1,j = 1;i<=n&&j<=n;b[ls[i++]] = 0){
            while(j<=n&&b[ls[j]] == 0){
                b[ls[j++]] = 1;
            }
            ans = max(ans,j-i);
        }
        cout<<ans<<endl;
    }
    return 0;
}

rt