#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, d;
void solve()
{
cin >> n >> m >> d;
vector<int> p(n + 1);
vector<int> pos(n + 1);
for (int i = 1; i <= n; i ++)
{
cin >> p[i]; // 排列
pos[p[i]] = i;
}
vector<int> a(m + 1);
int mmin = n + 1;
int mmax = - n - 1;
for (int i = 1; i <= m; i ++) cin >> a[i]; // 数组
for (int i = 1; i < m; i ++)
{
if (pos[a[i]] >= pos[a[i + 1]] || pos[a[i + 1]] > pos[a[i]] + d)
{
cout << 0 << "\n";
return ;
}
mmin = min(pos[a[i + 1]] - pos[a[i]], mmin);
mmax = max(pos[a[i + 1]] - pos[a[i]], mmax); // 距离小于d
}
if (d + 1 - mmax <= mmin && d <= n - 2) cout << d - mmax + 1<< "\n"; // d + 1 大, mmax 小,所以d + 1 - m
The Forbidden Permutation
最新推荐文章于 2024-08-02 20:41:30 发布