Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Minimum Distances
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main()
- {
- long long int n, s[100001], min=100001;
- cin >> n;
- for(int i=0;i<n;i++)
- {
- cin >> s[i];
- }
- for(int i=0;i<n;i++)
- {
- for(int y=0;y<n;y++)
- {
- if(y!=i)
- {
- if(s[i]==s[y])
- {
- if((abs((i)-y))<min)
- {
- min=abs((i)-y);
- }
- }
- }
- }
- }
- if(min==100001){cout<<"-1";}
- else{cout<< min<<endl;}
- return 0;
- }
Add Comment
Please, Sign In to add comment