变种串匹配

题目请见CEOI2011 mat

solution请见CEOI2011 solution

注：按题解的方法，如果不要排序b，就可以达到O(n+m)的时间复杂度！

code：

#include <stdio.h>
#include <memory.h>

#define maxn 1000010
#define maxm 1000010

int p[maxn];
int t[maxm];
int g[maxn];
int h[maxn];
int pred[maxn];
int next[maxn];
int pos[maxn];
int ans[maxn];
int n, m;

void prepare ()
{
  int i;
  for (i = 1; i <= n; ++i)
    pred[i] = i - 1, next[i] = i + 1, pos[p[i]] = i;
  for (i = n; i; --i)
    {
      int s = pred[p[i]], t = next[p[i]];
      pred[t] = s;
      next[s] = t;
      g[i] = i - pos[s];
      h[i] = i - pos[t];
    }
}

inline int chk (int *t, int ps, int ts)
{
  return (g[ps] == ps || t[ts - g[ps]] < t[ts]) && (h[ps] == ps || t[ts - h[ps]] > t[ts]);
}

void build ()
{
  int i, j = 0;
  memset (next, 0, sizeof (next));
  for (next[1] = 0, i = 2; i <= n; ++i)
    {
      for (;j && !chk (p, j + 1, i); j = next[j]);
      if (chk (p, j + 1, i)) ++j;
      next[i] = j;
    }
}

void match ()
{
  int i, j = 0;
  for (i = 1; i <= m; ++i)
    {
      for (; j && !chk (t, j + 1, i); j = next[j]);
      if (chk (t, j + 1, i)) ++j;
      if (j == n)
        ans[++ans[0]] = i - n + 1;
    }
}

int main()
{
  FILE *fin  = fopen ("mat.in" , "r");
  FILE *fout = fopen ("mat.out", "w");

  int i, s;

  fscanf (fin, "%d%d", &n, &m);
  for (i = 1; i <= n; ++i)
    fscanf (fin, "%d", &s), p[s] = i;
  for (i = 1; i <= m; ++i)
    fscanf (fin, "%d", &t[i]);
  prepare ();
  build ();
  match ();
  
  fprintf (fout, "%d\n", ans[0]);
  for (i = 1; i <= ans[0]; ++i)
    fprintf (fout, "%d ", ans[i]);
  fclose (fin);
  fclose (fout);
  return 0;
}

话说，我以前用hash也写了个，速度慢得多

#include <stdio.h>
#include <memory.h>
#include <stdlib.h>

/* #define mod 100000007 */
/* #define prod 10000007 */
const int mod = 100000007;
const int prod = 10000007;

#define maxn 1000008
#define maxm 1000008
#define maxst 1048576

typedef struct {int s, h;} node;
typedef long long ll;

node st[maxst << 1], *dbg = st + maxst;
ll power[maxn];
int h[maxm];
int ans[maxn], *pos = ans, *idx = ans;
int n, m;

node combine (node l, node r)
{
  node ret;
  ret.s = l.s + r.s;
  ret.h = (int)((l.h + ((ll)r.h * power[l.s])) % mod);
  return ret;
}

void modify (int i, node v)
{
  for (st[i += maxst] = v, i >>= 1; i; i >>= 1)
    st[i] = combine (st[i << 1], st[i << 1 | 1]);
}

node query (int l, int r)
{
  node lans = (node){0, 0}, rans = (node){0, 0};
  for (l += maxst - 1, r += maxst + 1; l ^ r ^ 1; l >>= 1, r >>= 1)
    {
      if (~l & 1) lans = combine (lans, st[l ^ 1]);
      if ( r & 1) rans = combine (st[r ^ 1], rans);
    }
  return combine (lans, rans);
}

int cmper (const void *i, const void *j)
{
  return h[*(int *)i] - h[*(int *)j];
}

void init ()
{
  int i;
  for (i = 1; i <= m; ++i)
    idx[i] = i;
  qsort (idx + 1, m, sizeof (idx[0]), cmper);
  for (i = 1; i <= m; ++i)
    h[idx[i]] = i;
}

int main()
{
  freopen ("mat.in" , "r", stdin);
  freopen ("mat.out", "w", stdout);

  int i, j;
  ll dest = 0, minus = 0;

  scanf ("%d%d", &n, &m);
  for (i = 1, power[0] = 1; i <= n; ++i)
    power[i] = power[i - 1] * prod % mod, minus += power[i - 1];
  for (i = 1; i <= n; ++i)
    scanf ("%d", &j), dest = (dest + j * power[i - 1]) % mod;
  for (i = 1; i <= m; ++i)
    scanf ("%d", &h[i]);

  init (), minus %= mod;

  for (i = 1; i <= n; ++i)
    modify (h[i], (node){1, i});
  for (; i <= m + 1; ++i)
    {
      if (st[1].h == dest)
        ans[++ans[0]] = i;
      dest += minus;
      if (dest >= mod)
        dest -= mod;
      modify (h[i    ], (node){1, i});
      modify (h[i - n], (node){0, 0});
    }

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