poj2217_Secretary（后缀数组+高度数组）

#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>

using namespace std;

vector<int> sa;
vector<int> grade;
vector<int> tmpg;
int lcp[10010];
string s;
int k;
int n;

bool cmp(int a, int b)
{
    if (grade[a] != grade[b])
        return grade[a] < grade[b];
    else{
        int nexa = a + k <= n ? grade[a + k] : -1;
        int nexb = b + k <= n ? grade[b + k] : -1;
        return nexa < nexb;
    }
}

void getsa()
{
    sa.clear();
    grade.clear();
    tmpg.clear();
    n = s.size();
    for (int i = 0; i <= n; i++)
    {
        sa.push_back(i);
        grade.push_back(i < n ? s[i] : -1);
    }
    tmpg = grade;
    for (k = 1; k <= n; k *= 2)
    {
        sort(sa.begin(), sa.end(), cmp);
        tmpg[sa[0]] = 0;
        for (int i = 1; i <= n; i++)
        {
            tmpg[sa[i]] = tmpg[sa[i - 1]] + (cmp(sa[i-1],sa[i])?1:0);
        }
        copy(tmpg.begin(), tmpg.end(), grade.begin());
    }
}

void getlcp()
{
    for (int i = 0; i <= n; i++)
        grade[sa[i]] = i;
    int h = 0;
    lcp[sa[0]] = 0;
    for (int i = 0; i < n; i++)
    {
        int j=sa[grade[i] - 1];
        if (h > 0)
            h--;
        for (; i + h < n&&j + h < n; h++)
            if (s[i + h] != s[j + h])
                break;
        lcp[grade[j]] = h;
    }
}

int main()
{
    int t;
    cin >> t;
    getchar();
    for (int i = 0; i < t; i++)
    {
        string s1, s2;
        getline(cin, s1);
        getline(cin, s2);
        s = s1 + '$' + s2;
        getsa();
        getlcp();
        int res = 0;
        for (int j = 0; j < s.size(); j++)
        {
            if ((sa[j] < s1.size()) != (sa[j +1] < s1.size()))
                res = max(res, lcp[j]);
        }
        cout << "Nejdelsi spolecny retezec ma delku " << res << "." << endl;
    }
    return 0;
}