Pagini recente » Cod sursa (job #1294654) | Cod sursa (job #3204108) | Cod sursa (job #2380841) | Cod sursa (job #2371372) | Cod sursa (job #2466211)
//TEST
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv.in");
ofstream out("secv.out");
const int N = 5005;
int v[N],dp[N];
bool lazynorm[N],viz[N];
int main()
{
int n;
in >> n;
for (int i = 1; i<=n; i++)
in >> v[i];
int k = 0;
for (int i = 1; i<=n; i++)
{
int Min = INT_MAX, poz = 0;
for (int j = 1; j<=n; j++)
if (v[j]<Min && !lazynorm[j])
{
Min = v[j];
poz = j;
}
if (!poz)
break;
k++;
for (int j = 1; j<=n; j++)
if (v[j] == Min)
{
lazynorm[j] = 1;
v[j] = k;
}
}
int ans = INT_MAX;
for (int i = 1; i<=n; i++)
{
memset(viz,0,sizeof(viz));
memset(dp,0,sizeof(dp));
viz[0] = 1;
for (int j = i; j<=n; j++)
{
if (viz[v[j]-1] && !viz[v[j]])
{
viz[v[j]] = 1;
dp[v[j]] = j;
}
}
if (viz[1] && viz[k])
ans = min(ans,dp[k]-dp[1]+1);
}
out << ans;
}