n=int(input())
a=list(map(int,input().strip().split()))
mn=min(a)
b=[]
for i in range(n):
if a[i]==mn:b.append(i)
mnd=b[1]-b[0]
for i in range(len(b)-1):
mnd=min(mnd,b[i+1]-b[i])
print(mnd)#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> > ck;
int main()
{
int n,i,x,y;
cin>>n;
for(i=0;i<n;i++)
{
cin>>x;
ck.push_back({x,i});
}
sort(ck.begin(),ck.end());
x=ck[0].first;
int mn=INT_MAX;
for(i=1;i<n;i++)
{
if(ck[i].first==x)
{
mn=min(mn,abs(ck[i].second-ck[i-1].second));
}
else break;
}
cout<<mn<<endl;
}
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |