题意:
有序的给出 n n n个数,同时 m m m对 ( a , b ) (a,b) (a,b),表示如果 a a a在 b b b前面且 a b ab ab间无间隔, a a a和 b b b可以交换位置,现问最后一个数最多能往前移动多少步。
题解:
假设最后一个数能交换到第i个位置,那么第i个数的后缀数目等于两者间距离。
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5+10;
vector< int > a, b;
vector<int> c[maxn];
int main()
{
int n, m, w1, w2;
scanf("%d %d", &n, &m);
a.resize(n);
b.resize(n);
a.push_back(0);
b.push_back(0);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= m; ++i) {
scanf("%d %d", &w1, &w2);
c[w1].push_back(w2);
}
reverse(a.begin()+1, a.end());
int ans = 0, cnt = 1;
for (int i = 0; i <= n; ++i) b[i] = 0;
b[a[1]] = 1;
for (int i = 2; i <= n; ++i) {
int cnt2 = 0;
for (int to : c[a[i]]) {
if (b[to]) cnt2++;
}
if (cnt == cnt2) ans++;
else {
b[a[i]] = 1;
cnt++;
}
}
cout << ans << '\n';
return 0;
}