ybtoj+H. 4.字符串匹配 (贪心+KMP）

思路：想到用一个last数组来存下交换前与交换后；

实现：存下一个数的前一个与他相同的距离，然后kmp比较；

数据结构：使用last数组来维护；

code:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10;
int ne[N], cnt[N], last[N], a[N], b[N], s[N], p[N], r[N];
int sov(int x, int len) {
    if (x >= len)//防止交换后越界,存交换前的值
        x = 0;
    return x;
}
int main() {
    int t, c;
    cin >> t >> c;
    while (t--) {
        int n, m;
        cin >> n >> m;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            s[i] = i - last[a[i]];//同下
            last[a[i]] = i;
        }
        memset(last, 0, sizeof last);
        for (int i = 1; i <= m; i++) {
            cin >> b[i];
            p[i] = i - last[b[i]];//求last数组
            last[b[i]] = i;
        }
        memset(last, 0, sizeof last);
        memset(ne, 0, sizeof ne);
        int ans = 0;
        for (int i = 2, j = 0; i <= m; i++) {
            while (j && sov(p[i], j + 1) != sov(p[j + 1], j + 1)) j = ne[j];
            if (sov(p[i], j + 1) == sov(p[j + 1], j + 1))//KMP
                j++;
            ne[i] = j;
        }
        for (int i = 1, j = 0; i <= n; i++) {
            while (j && sov(s[i], j + 1) != sov(p[j + 1], j + 1)) j = ne[j];
            if (sov(s[i], j + 1) == sov(p[j + 1], j + 1))//KMP
                j++;
            if (j == m) {
                r[ans++] = i - m + 1;//存答案
                j = ne[j];
            }
        }
        cout << ans << endl;
        for (int i = 0; i < ans; i++) {
            cout << r[i] << " ";
        }
        cout << endl;
    }
    return 0;
}