Array

http://codeforces.com/problemset/problem/224/B

暴力

#include <iostream>
using namespace std;
const int maxn=100005;
bool f[maxn];
int ans[maxn],s[maxn];
int main()
{
    int n,k,i,j,mark;
    cin>>n>>k;
    {
        mark=-1;
        for(i=0;i<n;i++)
        {
            cin>>ans[i];
            if(f[ans[i]]) s[i]=s[i-1];
            else
            {
                f[ans[i]]=1;
                s[i]=s[i-1]+1;  
                if(s[i]==k) mark=i;
            }
        }
        if(mark>=0)
        {
            j=k;
            for(i=mark;i>=0,j>0;i--)
            {
                if(f[ans[i]])
                {
                    f[ans[i]]=0;
                    j--;
                }
                else
                {
                    continue;
                }
            }
            cout<<i+2<<" "<<mark+1<<endl;
        }
        else 
        {
            cout<<"-1 -1"<<endl;
        }
    }
    return 0;
}