Codeforces1208B 二分

https://codeforces.com/contest/1208/problem/B
n=2000 ai<=1e9 值访问次数最多2000
n²logn=4e6*11=44e6=5e7

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
typedef long long ll;
const int maxn=4e5+5;
const int INF=0x3f3f3f3f;
int n,f;
int a[2005];
map<int,int> vis;
bool check(int mid){
	for(int i=1;i<=n-mid+1;i++){
		f=0;
		for(int j=i;j<=i+mid-1;j++){
			vis[a[j]]--;	
		}
		for(int k=1;k<=n;k++){
			if(vis[a[k]]>1)
			{
				f=1;
				break;
			}
		}
		for(int j=i;j<=i+mid-1;j++){
			vis[a[j]]++;	
		}
		if(!f)
			return true;
	}
	return false;

}
int main(){
	cin>>n;
	rep(i,1,n){
		cin>>a[i];
		vis[a[i]]++;
	}
	int l=0,r=n-1,ans=0;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid)){
			ans=mid;
			r=mid-1;
		}
		else
			l=mid+1;
	}
	cout<<ans<<endl;
	return 0;
}

O(n²)

在这里插入代码片