Educational Codeforces Round 35 A - Nearest Minimums

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 7, maxd = 1e5 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n;
int a[maxn], min_ = INF, ans = INF;

int main() {
    kuaidian;

    cin >> n;
    for(int i = 0; i < n; ++i) {
        cin >> a[i];
        min_ = min(min_, a[i]);
    }

    int id = -1;
    for(int i = 0; i < n; ++i) {
        if(a[i] == min_) {
            if(id >= 0) {
                ans = min(ans, i - id);
            }
            id = i;
        }
    }
    cout << ans;

    return 0;
}