Educational Codeforces Round 5 D. Longest k-Good Segment

D. Longest k-Good Segment

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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/printfinstead 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.

Sample test(s)

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

解题报告：Editorial of Educational Codeforces Round 5

题意

给你n个数，你需要找到一个最长的区间，使得这个区间里面不同的数小于等于k个

题解：

尺取法扫一遍就好了

#include
   
   
    
    
#include
    
    
     
     
using namespace std;
const int N=1e6+1;
int a[N],b[N];
int main()
{
    int n,m,j,i,ans,l,r;
    int ll=0,rr=0;
    scanf("%d%d",&n,&m);
    for(i=0; i