UVA11572UniqueSnowflakes

//UVA11572UniqueSnowflakes#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<map>using namespace std;const int MAXN = 1e6 + 10;int a[MAXN];int main() {int T;//freopen("UVA11572out.txt", "w", stdout);scanf("%d", &T);while(T--) {int n;int ans = 0;scanf("%d", &n);for(int i = 0; i < n; i++) scanf("%d", &a[i]);map<int, int> store;int L = 0, R = 0;for(int i = 0; i < n; i++) {R = i;if(store.count(a[i]) && store[a[i]] + 1 > L) L = store[a[i]] + 1;store[a[i]] = i;//更新对应关系ans = max(ans, R - L + 1); //printf("R = %d, L = %d, ans = %d\n", R, L, ans);}printf("%d\n", ans);}} /*1512321*/