CodeForces - 1208B Uniqueness 二分+离散

题目链接：https://cn.vjudge.net/problem/CodeForces-1208B

题解：二分答案，然后枚举区间，注意要先离散，直接用map会T

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mp[2010];
int n, a[2010], b[2010];
bool judge(int x) {
	int flag = 0;
	for(int i = 1; i <= n - x + 1; i++) {
		for(int j = 1; j <= n; j++) mp[j] = 0;
		int j;
		for(j = 1; j <= n; j++) {
			if(j >= i && j <= i + x - 1) continue;
			if(mp[a[j]]) break;
			mp[a[j]] = 1;
		}
		if(j == n + 1) return true;
	}
	return false;
}
int main() {
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i], b[i] = a[i];
	sort(b + 1, b + 1 + n);
	int len = unique(b + 1, b + 1 + n) - (b + 1);
	for(int i = 1; i <= n; i++)
		a[i] = lower_bound(b + 1, b + 1 + n, a[i]) - b;
	int l = 0, r = n;
	int mid, res;
	while(l <= r) {
		mid = (l + r) >> 1;
		if(judge(mid)) {
			res = mid;
			r = mid - 1;
		} else l = mid + 1;
	}
	cout << res << endl;
	return 0;
}