poj 3415 Common Substrings（后缀数组 | 后缀自动机）

题目链接：poj 3415 Common Substrings

代码-后缀数组

#include <cstdio>
#include <cstring>
#include <stack>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 2 * 1e5 + 5;

struct Suffix_Arr {
    int n, s[maxn];
    int SA[maxn], rank[maxn], height[maxn];
    int tmp_one[maxn], tmp_two[maxn], c[305];

    int d[maxn][20];

    void init(char* str, int len);
    void build(int m);
    void get_height();

    ll get(int l, int r, int k, int p);
    ll solve(int k, int p);
}SFA;

int K;
char a[maxn], b[maxn];

int main () {
    while (scanf("%d", &K) == 1 && K) {
        scanf("%s%s", a, b);
        int na = strlen(a), nb = strlen(b);
        a[na] = 1;
        for (int i = 0; i <= nb; i++) a[na + i + 1] = b[i];
        SFA.init(a, na + nb + 1);
        printf("%lld\n", SFA.solve(K, na));
    }
    return 0;
}

void Suffix_Arr::init(char* str, int len) {
    n = 0;
    for (int i = 0; i < len; i++)
        s[n++] = str[i];
    s[n++] = 0;
}

ll Suffix_Arr::get(int l, int r, int k, int p) {
    ll ret = 0;

    ll sum = 0;
    stack<pii> st;

    for (int i = l; i <= r; i++) {
        pii u = make_pair(height[i], 0);
        while (!st.empty() && st.top().first >= u.first) {
            pii v = st.top(); st.pop();
            sum -= 1LL * (v.first - k + 1) * v.second;
            u.second += v.second;
        }
        sum += 1LL * (u.first - k + 1) * u.second;
        st.push(u);
        if (SA[i] < p) {
            st.push(make_pair(n, 1));
            sum += 1LL * (n - k + 1);
        } else
            ret += sum;
    }

    sum = 0;
    while (!st.empty()) st.pop();

    for (int i = l; i <= r; i++) {
        pii u = make_pair(height[i], 0);
        while (!st.empty() && st.top().first >= u.first) {
            pii v = st.top(); st.pop();
            sum -= 1LL * (v.first - k + 1) * v.second;
            u.second += v.second;
        }
        sum += 1LL * (u.first - k + 1) * u.second;
        st.push(u);
        if (SA[i] > p) {
            st.push(make_pair(n, 1));
            sum += 1LL * (n - k + 1);
        } else
            ret += sum;
    }

    //printf("%d %d %lld\n", l, r, ret);
    return ret;
}

ll Suffix_Arr::solve(int k, int p) {
    build(300);
    get_height();

    ll ret = 0;
    int l = 0, r = 0;

    /*
    for (int i = 0; i < n; i++) printf("%3d ", height[i]);
    printf("\n");
    for (int i = 0; i < n; i++) printf("%3d ", SA[i]);
    printf("\n");
    */

    while (l < n) {
        r = l + 1;
        while (r < n && height[r] >= k) r++;
        ret += get(l, r-1, k, p);
        l = r;
    }
    /*
    */
    return ret;
}


void Suffix_Arr::get_height() {
    for (int i = 0; i < n; i++)
        rank[SA[i]] = i;
    int mv = height[0] = 0;
    for (int i = 0; i < n - 1; i++) {
        if (mv) mv--;

        int j = SA[rank[i]-1];
        while (s[i+mv] == s[j+mv]) mv++;
        height[rank[i]] = mv;
    }
}

void Suffix_Arr::build(int m) {
    int* x = tmp_one, *y = tmp_two;

    for (int i = 0; i < m; i++) c[i] = 0;
    for (int i = 0; i < n; i++) c[x[i] = s[i]]++;
    for (int i = 1; i < m; i++) c[i] += c[i-1];
    for (int i = n - 1; i >= 0; i--) SA[--c[x[i]]] = i;

    for (int k = 1; k <= n; k <<= 1) {
        int mv = 0;
        for (int i = n - k; i < n; i++) y[mv++] = i;
        for (int i = 0; i < n; i++) if(SA[i] >= k) 
            y[mv++] = SA[i] - k;

        for (int i = 0; i < m; i++) c[i] = 0;
        for (int i = 0; i < n; i++) c[x[y[i]]]++;
        for (int i = 1; i < m; i++) c[i] += c[i-1];
        for (int i = n - 1; i >= 0; i--) SA[--c[x[y[i]]]] = y[i];

        swap(x, y);
        mv = 1;
        x[SA[0]] = 0;

        for (int i = 1; i < n; i++)
            x[SA[i]] = (y[SA[i-1]] == y[SA[i]] && y[SA[i-1] + k] == y[SA[i] + k] ? mv - 1 : mv++);

        if (mv >= n) break;
        m = mv;
    }
}

/*
int Suffix_Arr::rmq_query(int x, int y) {
    if (x == y) return d[x][0];
    if (x > y) swap(x, y);

    x++;
    int k = 0;
    while ((1<<(k+1)) <= y - x + 1) k++;
    return min(d[x][k], d[y-(1<<k)+1][k]);
}
void Suffix_Arr::rmq_init() {
    for (int i = 0; i < n; i++) d[i][0] = height[i];

    for (int k = 1; (1<<k) <= n; k++) {
        for (int i = 0; i + (1<<k) - 1 < n; i++)
            d[i][k] = min(d[i][k-1], d[i+(1<<(k-1))][k-1]);
    }
}

*/

代码-后缀自动机

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
const int SIGMA_SIZE = 52;

struct SAM {
    int sz, last;
    int g[maxn<<1][SIGMA_SIZE], pre[maxn<<1], step[maxn<<1];
    int pos[maxn<<1], right[maxn<<1], cnt[maxn<<1];

    void newNode(int s) {
        step[++sz] = s;
        pre[sz] = 0;
        memset(g[sz], 0, sizeof(g[sz]));
    }

    int idx(char ch) { 
        if (ch >= 'A' && ch <= 'Z') return ch - 'A' + 26;
        return ch -'a';
    }

    void init() {
        sz = 0, last = 1;
        newNode(0);
    }

    void insert(char ch);
    void get_tuopu();
    void get_right(char* str);
    ll solve (int k, char* str) {
        ll ret = 0;
        memset(cnt, 0, sizeof(cnt));
        int n = strlen(str), p = 1, lcs = 0;

        for (int i = 0; i < n; i++) {
            int v = idx(str[i]);

            if (g[p][v]) lcs++, p = g[p][v];
            else {
                while (p && !g[p][v]) p = pre[p];
                if (p) lcs = step[p] + 1, p = g[p][v];
                else lcs = 0, p = 1;
            }

            if (lcs >= k) {
                ret += 1LL * (lcs - max(k, step[pre[p]] + 1) + 1) * right[p];
                if (k <= step[pre[p]]) cnt[pre[p]]++;
            }
        }

        for (int i = sz; i; i--) {
            p = pos[i];
            ret += 1LL * cnt[p] * (step[p] - max(k, step[pre[p]] + 1) + 1) * right[p];
            if (k <= step[pre[p]]) cnt[pre[p]] += cnt[p];
        }
        return ret;
    }
}SA;

int K;
char a[maxn], b[maxn];

int main () {
    while (scanf("%d", &K) == 1 && K) {
        SA.init();
        scanf("%s%s", a, b);
        int n = strlen(a);
        for (int i = 0; i < n; i++)
            SA.insert(a[i]);
        SA.get_tuopu();
        SA.get_right(a);

        printf("%lld\n", SA.solve(K, b));
    }
    return 0;
}

void SAM::insert(char ch) {
    newNode(step[last] + 1);
    int v = idx(ch), p = last, np = sz;

    while (p && !g[p][v]) {
        g[p][v] = np;
        p = pre[p];
    }

    if (p) {
        int q = g[p][v];
        if (step[q] == step[p] + 1)
            pre[np] = q;
        else {
            newNode(step[p] + 1);
            int nq = sz;
            for (int j = 0; j < SIGMA_SIZE; j++) g[nq][j] = g[q][j];

            pre[nq] = pre[q];
            pre[np] = pre[q] = nq;

            while (p && g[p][v] == q) {
                g[p][v] = nq;
                p = pre[p];
            }
        }
    } else
        pre[np] = 1;
    last = np;
}

void SAM::get_tuopu() {
    for (int i = 0; i <= sz; i++) cnt[i] = 0;
    for (int i = 1; i <= sz; i++) cnt[step[i]]++;
    for (int i = 1; i <= sz; i++) cnt[i] += cnt[i-1];
    for (int i = 1; i <= sz; i++) pos[cnt[step[i]]--] = i; 
}

void SAM::get_right(char* str) {
    int p = 1, n = strlen(str);
    for (int i = 0; i <= sz; i++) right[i] = 0;

    for (int i = 0; i < n; i++) {
        int v = idx(str[i]);
        p = g[p][v];
        right[p]++;
    }

    for (int i = sz; i; i--) {
        int u = pos[i];
        right[pre[u]] += right[u];
    }
}