Submission #63299483

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10,M=1e5+10;
struct node
{
  int now,last,sum;
};
int n,miin=N;
bool b;
node a[N];
signed main()
{
  cin>>n;
  for(int i=1;i<=n;i++)
  {
    int c;
    cin>>c;
    a[c].sum++;
    if(a[c].sum==1)
    {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10,M=1e5+10;
struct node
{
	int now,last,sum;
};
int n,miin=N;
bool b;
node a[N];
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int c;
		cin>>c;
		a[c].sum++;
		if(a[c].sum==1)
		{
			a[c].now=i;
			continue;
		}
		a[c].last=a[c].now;
		a[c].now=i;
		b=1;
		miin=min(miin,a[c].now-a[c].last+1);
	}
	if(b==0)
	{
		cout<<"-1";
		return 0;
	}
	cout<<miin;
	return 0;
}

Submission Info

Judge Result