codeforces_616D. 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.

Examples

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

尺取法，这里有尺取法的说明，很详细。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;

int a[500010];
int v[1000010];
int main()
{
    int i,j,n,k;
    memset(v,0,sizeof(v));
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    int pi=1,pj=1,num=0,ansi=1,ansj=1;
    for(pj=1;pj<=n;pj++)
    {
        v[a[pj]]++;
        if(v[a[pj]]==1)num++;
        while(num>k)
        {
            v[a[pi]]--;
            if(v[a[pi]]==0)num--;
            pi++;
        }
        if(pj-pi+1>ansj-ansi+1)
        {
            ansi=pi;
            ansj=pj;
        }
    }
    printf("%d %d\n",ansi,ansj);
    return 0;
}