【KMP】poj-3167

/**
    题目读起来就是KMP
    不过匹配的要求与平常的KMP不同
    匹配模式是一个区间内的元素排序标号相同
**/

#include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int a[100100], b[25100], next[25100];
int num[100100];
int p[25100][26], q[100100][26];  /**q[i][j] p[i][j]分别表示在a[] b[]中前i个数 j出现的次数**/
int kmp(int len1, int len2)
{
int i, j, ei, ej, si, sj, k, ans;
    ans = 0;
    i = 0;
    j = 0;
while(i < len1 && j < len2)
    {
        si = 0;
        sj = 0;
for(k = 1; k < b[j]; k++)
            sj = sj + p[j][k];
        ej = p[j][b[j]];
if(i > j)
        {
for(k = 1; k < a[i]; k++)
                si = si + q[i][k] - q[i - j - 1][k];
            ei = q[i][a[i]] - q[i - j - 1][a[i]];

        }
else
        {
for(k = 1; k < a[i]; k++)
                si = si + q[i][k];
            ei = q[i][a[i]];
        }
if(j == -1 || (si == sj && ei == ej))
        {
            i++;
            j++;
        }
else
            j = next[j];
if(j == len2)
        {
            ans++;
            num[ans] = i - len2;
            j = next[j];
        }
    }
return ans;
}

int main()
{
int n, k, s, i, j, ans,len;
int l, ei, ej, si, sj;
while(scanf("%d%d%d", &n, &k, &s) != EOF)
    {
for(i = 0; i < n; i++)
            scanf("%d", &a[i]);
for(i = 0; i < k; i++)
            scanf("%d", &b[i]);
        q[0][a[0]] = p[0][b[0]] = 1;
for(i = 1; i < n; i++)
        {            /**计算q[][] p[][]**/
for(j = 1; j <= s; j++)
                q[i][j] = q[i - 1][j];
            q[i][a[i]]++;
        }
for(i = 1; i < k; i++)
        {
for(j = 1; j <= s; j++)
                p[i][j] = p[i - 1][j];
            p[i][b[i]]++;
        }

        len=k;
        i = 0;
        j = -1;
        next[0] = -1;
while(i < len)
        {
           si = sj = 0;
for(l = 1; l < b[j]; l++)
               sj = sj + p[j][l];
           ei = p[j][b[j]];
for(l = 1; l < b[i]; l++)
              si = si + (p[i][l] - p[i - j - 1][l]);
           ej = p[i][b[i]] - p[i - j - 1][b[i]];
if(j == -1 || (ei == ej && si == sj))
           {
               i++;
               j++;
               next[i] = j;
           }
else
           j = next[j];
        }

        ans = kmp(n, k);

        printf("%d\n", ans);

for (i = 1; i <= ans; i++)
            printf("%d\n", num[i]+1);
    }
return 0;
}

转载于:https://www.cnblogs.com/zuckerTT/archive/2011/11/12/2246081.html