CodeForces - 224B：Array（思维题）

Discription
You’ve got an array a, consisting of n integers: a1, a2, …, an. Your task is to find a minimal by inclusion segment [l, r] (1 ≤ l ≤ r ≤ n) such, that among numbers al,  al + 1,  …,  ar there are exactly k distinct numbers.

Segment [l, r] (1 ≤ l ≤ r ≤ n; l, r are integers) of length m = r - l + 1, satisfying the given property, is called minimal by inclusion, if there is no segment [x, y] satisfying the property and less then m in length, such that 1 ≤ l ≤ x ≤ y ≤ r ≤ n. Note that the segment [l, r] doesn’t have to be minimal in length among all segments, satisfying the given property.

Input
The first line contains two space-separated integers: n and k (1 ≤ n, k ≤ 105). The second line contains n space-separated integers a1, a2, …, an — elements of the array a (1 ≤ ai ≤ 105).

Output
Print a space-separated pair of integers l and r (1 ≤ l ≤ r ≤ n) such, that the segment [l, r] is the answer to the problem. If the sought segment does not exist, print “-1 -1” without the quotes. If there are multiple correct answers, print any of them.

Examples
Input
4 2
1 2 2 3
Output
1 2
Input
8 3
1 1 2 2 3 3 4 5
Output
2 5
Input
7 4
4 7 7 4 7 4 7
Output
-1 -1

Note
In the first sample among numbers a1 and a2 there are exactly two distinct numbers.

In the second sample segment [2, 5] is a minimal by inclusion segment with three distinct numbers, but it is not minimal in length among such segments.

In the third sample there is no segment with four distinct numbers.

题目大意
给出一行n个数，要求在这n个数中找出正好含有m个不同的数的子序列。要求不需要输出最短的，但是所求字符串必须在当前选择下是最短的，没有冗余。输出任意一种结果。

思路
这道题主要还是死在英语上，开始我以为只要随便找一个字符串就可以，然后WA了，后来以为是求字符串和最小，后来又以为是求最短的字符串，然后就一直WA。后来听别人讲了一遍才读懂题意。
这道题可以直接从第一个开始找，找到r的位置，然后再从第m往前找l的位置。

AC代码

#include<bits/stdc++.h>
using namespace std;
int n,k,l,r,sum,f;
int a[100010],b[100100];
int main()
{
    cin>>n>>k;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    int p=2;
    for(int i=1;i<=n;i++)
    {
        if(b[a[i]])
            continue;
        b[a[i]]=1;
        sum++;
        if(sum==k)
        {
            r=i;
            f=1;
            break;
        }
    }
    memset(b,0,sizeof(b));
    sum=0;
    for(int i=r;i>=1;i--)
    {
        if(b[a[i]])
            continue;
        b[a[i]]=1;
        sum++;
        if(sum==k)
        {
            l=i;
            break;
        }
    }
    if(f)
        cout<<l<<" "<<r<<endl;
    else
        cout<<-1<<" "<<-1<<endl;
    return 0;
}