Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <cstring>
- #include <string>
- #include <sstream>
- #include <map>
- #include <list>
- #include <queue>
- #include <set>
- #include <algorithm>
- #include <climits>
- #include <cmath>
- #include <cassert>
- #include <stack>
- #include <bitset>
- #include <tr1/unordered_map>
- #include <tr1/unordered_set>
- #define mp make_pair
- #define ll long long
- #define ull unsigned long long
- const int INF=(INT_MAX>>2);
- using namespace std;
- int a[100000];
- bitset<100000+1> f;
- int main() {
- // freopen("me.txt","r",stdin);
- //freopen("out.txt","w",stdout);
- int n,k;
- cin>>n>>k;
- for(int i=0;i<n;cin>>a[i++]) ;
- int nusf=0; // number unique so far
- int r2=-1;
- f.reset();
- for(int i=0;i<n && r2==-1;++i) {
- if(!f[a[i]]) {
- f[a[i]]=true;
- ++nusf;
- if(nusf==k) r2=i;
- }
- }
- f.reset();
- int r1=-1;
- nusf=0;
- for(int i=r2;i>=0 && r1==-1;--i) {
- if(!f[a[i]]) {
- f[a[i]]=true;
- ++nusf;
- if(nusf==k) r1=i;
- }
- }
- if(r2!=-1) cout<<(r1+1)<<" "<<(r2+1);
- if(r2==-1) puts("-1 -1");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement