#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int arr[]={1,2,3,1,4,5};
int n=sizeof(arr)/sizeof(arr[0]);
int k=3;
unordered_map<int,int>u;
for(int i=0;i<n;i++){
if(u.find(arr[i])!=u.end()){
int dist=i-u[arr[i]];
if(dist<=k){
cout<<"Yes";
u[arr[i]]=i;
return 0;
}
}
else{
u[arr[i]]=i;
}
}
cout<<"no";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYXJyW109ezEsMiwzLDEsNCw1fTsKCWludCBuPXNpemVvZihhcnIpL3NpemVvZihhcnJbMF0pOwoJaW50IGs9MzsKCXVub3JkZXJlZF9tYXA8aW50LGludD51OwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJaWYodS5maW5kKGFycltpXSkhPXUuZW5kKCkpewoJCQlpbnQgZGlzdD1pLXVbYXJyW2ldXTsKCQkJaWYoZGlzdDw9ayl7CgkJCQljb3V0PDwiWWVzIjsKCQkJCXVbYXJyW2ldXT1pOwoJCQkJcmV0dXJuIDA7CgkJCX0KIAoJCX0KCQllbHNlewoJCQl1W2FycltpXV09aTsKCQl9CiAKCX0KCWNvdXQ8PCJubyI7CglyZXR1cm4gMDsKfQ==