CF 126B（KMP 利用next数组枚举前后缀相同的子串）

最新推荐文章于 2024-09-12 19:02:20 发布

whoammiiiiii

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量207

点赞数

分类专栏： KMP/扩展kmp 文章标签：算法字符串 kmp

本文链接：https://blog.csdn.net/qq_43555854/article/details/105302347

版权

KMP/扩展kmp 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

题目链接

题意：
求一个最长的子串，这个子串在开头，结尾，中间都要出现过，没有就输出just a legend

思路：
利用kmp的next数组从最长的往短的枚举所有可能的子串，如果得到就break掉，不然会超时（如：aaaaaa…），设字符串下标为(0~n-1)那么就j从2到n-1（不是开头也不是结尾）看有没有next[j]和i相同就可以了。

/**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-04-03-18.55.15 Friday
*/
#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, a, b) for (int i = (int)(a); i >= (int)b; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define ms(x, y) memset(x, y, sizeof(x))
#define SZ(x) ((int)(x).size())

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const int maxn = (int)1e6+1000;
int nxt[maxn];
char x[maxn];

void kmp_pre(char x[], int m, int nxt[]) {
    int i, j;
    j = nxt[0] = -1;
    i = 0;
    while (i <= m) {
        while (-1 != j && x[i] != x[j]) j = nxt[j];
        nxt[++i] = ++j;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "r", stdin);
#endif

    cin >> x;
    int len = strlen(x);
    kmp_pre(x, len, nxt);
    int ans = -1;
    for (int i = nxt[len]; i > 0; i = nxt[i]) {
    cerr << i << endl;
        for (int j = 2; j < len; ++j) {
            if (nxt[j] == i) {
                ans = i;
            }
        }
        if (ans != -1) break;
    }
    if (ans == -1) cout << "Just a legend" << '\n';
    else {
        for (int i = 0; i < ans; ++i) {
            cout << x[i];
        } cout << '\n';
    }

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}