求条P1638

#include <bits/stdc++.h>
using namespace std;
int n,m,nmap[1000005],x = 1,y = 1,lowx = x,lowy = y,lowv = 1e9,vis[2005],cnt;
int main()
{
        cin >> n >> m;
	for (int i = 1;i <= n;i++)
	{
		cin >> nmap[i];
	}
	while (y <= n)
	{
		if (vis[nmap[y]] == 0)
		{
			cnt++;
		}
		vis[nmap[y]]++;
		if (cnt == m)
		{
			while (cnt == m)
			{
				if (y - x + 1 < lowv)
				{
					lowx = x;
					lowy = y;
					lowv = y - x + 1;
				}
				else if(y - x + 1 == lowv)
				{
					if (x < lowx)
					{
						lowx = x;
						lowy = y;
					}
				}
				vis[nmap[x]]--;
				if (vis[nmap[x]] == 0)
				{
					cnt --;
					break;
				}
				x++;
			}
		}
		y++;
	}
	cout << lowx << ' ' << lowy;
	return 0;
}