Unique Snowflakes UVA - 11572

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<int>a;
set<int>S;


int main()
{
    int T,n;
    int num;
    cin>>T;
    while(T--)
    {
        cin>>n;
        a.clear();
        S.clear();
        for(int i = 0; i<n; i++)
        {
            cin>>num;
            a.push_back(num);
        }
        int len = a.size();
        int ans = 0;
        int l = 0,r = 0;
        while(l<=r && r<len)
        {
            if(!S.count(a[r]))
            {
                S.insert(a[r++]);
            }
            else
            {
                ans = max(ans,r-l);
                S.erase(a[l]);
                l++;
            }
            if(r == len)
            {
                ans = max(ans,r-l);
            }
        }
        cout<<ans<<endl;
    }

    return 0;
}
/**
1
5
1
2
3
2
1
**/