WA code:

#include<iostream>
#include<iomanip>
#include<cmath>
#include<map>
#include<string>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<ctime>
#include<queue>
#include<cstring>
#include<vector>
#define sc scanf
#define pr printf
using namespace std;
int n,m,vis[1000001],p[10086],cnt,len,l=1,r,minn=2100000000,a,b;
void hz()
{
	for(int i=1;i<=n;i++)
	{
		vis[p[i]]++;
		while(r<=n)
		{
			if(cnt<m)
			{
				r++;
				if(vis[p[r]]!=0)
				{
					cnt++;
					vis[p[r]]++;
				}
			}
			else if(cnt==m)
			{
				if(vis[l]>=2)
				{
					vis[l]--;
				}
				else
				{
					vis[l]--;
					cnt--;
					if(l-r+1<minn)
					{
						minn=l-r+1;
						a=l;
						b=r;
					}
				}
				l++;
			}
		}
	}

}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>p[i];
	}
	hz();
	cout<<a<<" "<<b;
return 0;}

大佬们帮忙看看吧