Competetive-Programming/MinimumDistances.cpp at master · imabhinav-am/Competetive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int n,d,flag=0;
    cin >> n;
    int A[n];
    for(int i = 0;i < n;i++){
       cin >> A[i];
    }
    d=n-1;
    for(int i=0;i<n;i++)
    {
		for(int j=i+1;j<n;j++)
        {
            if(A[i]==A[j])
            {   flag=1;
                if(abs(j-i)<d)
                    d=abs(j-i);
            }
        }
    }
    if(flag==0)
        cout<<"-1";
    else
        cout<<d;
    return 0;
}