Longest k-Good Segment codeforces 616D map 简单应用

The array a with n integers is given. Let’s call the sequence of one or more consecutive elements in a segment. Also let’s call the segment k-good if it contains no more than k different values.

Find any longest k-good segment.

As the input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

Input
The first line contains two integers n, k (1 ≤ k ≤ n ≤ 5·105) — the number of elements in a and the parameter k.

The second line contains n integers ai (0 ≤ ai ≤ 106) — the elements of the array a.

Output
Print two integers l, r (1 ≤ l ≤ r ≤ n) — the index of the left and the index of the right ends of some k-good longest segment. If there are several longest segments you can print any of them. The elements in a are numbered from 1 to n from left to right.

Example
Input
5 5
1 2 3 4 5
Output
1 5
Input
9 3
6 5 1 2 3 2 1 4 5
Output
3 7
Input
3 1
1 2 3
Output
1 1

在长度为n的串中找出有k个不同数字的最长连续子串，输出子串开始以及结束的位置
尺取法

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define f(i,a,b) for(int i = a; i < b; i++)
typedef pair<int,int> P;
#define ll long long
int vis[1000010],a[500010];
int main()
{
    ios::sync_with_stdio(false);
    int n,k;
    cin >> n >> k;
    ff(i,1,n) cin >> a[i];
    int l = 1, r = 0,ansl,ansr,maxx = 0,tot = 0;
    while(r <= n)
    {
    	while(r <= n && tot <= k){
    		r++;
    		if(vis[a[r]] == 0)
    			tot++;
    		vis[a[r]]++;
    	}
    	if(r - l > maxx)
    	{
    		ansl = l,ansr = r - 1;
    		maxx = r - l;
    	}
    	while(l <= n && l <= r && tot > k)
    	{
    		vis[a[l]]--;
    		if(vis[a[l]] == 0) tot--;
    		l++;
    	}
    }
    cout << ansl << " " << ansr << endl;
	return 0;
}