【51nod 1277】:字符串中的最大值 KMP

传送门

分析

考虑$KMP$算法中¥next$数组的意义，如果$next[i] = 0$，表示$1-i$这一段字符串是唯一的前缀
所以，我们用$sum[i]$表示长度为$i$的前缀出现的次数，那么可以写出递推式$sum[ne[i]+=sum[i]$

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char str[N];
int n,ne[N],f[N];

void kmp(){
	for(int i = 2,j = 0;i <= n;i++){
        while(j && str[i] != str[j + 1]) j = ne[j];
        if(str[i] == str[j + 1]) j++;
        ne[i] = j;
    }
}

int main() {
	scanf("%s",str + 1);
	n = strlen(str + 1);
	kmp();
	for(int i = n;i;i--) {
		f[i]++;
		f[ne[i]] += f[i];
	}
	ll mx = 0;
	for(int i = 1;i <= n;i++) mx = max(mx,1ll * i * f[i]);
	dl(mx);
	return 0;
}