SPOJ NSUBSTR（SAM）

Description

给定一个串，求长度为$i$的串中出现次数最多的串的出现次数。

Solution

于是建出SAM，用len更新答案即可。

Source

/************************************************
 * Au: Hany01
 * Date: Mar 31st, 2018
 * Prob: SPOJ Substrings
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
	register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 250005;

int n, Ans[maxn];
char s[maxn];
vector<int> vct[maxn << 1];

struct SAM
{
	int fa[maxn << 1], ch[maxn << 1][26], sz[maxn << 1], tot = 1, len[maxn << 1], las = 1;

	inline void extend(int c)
	{
		int p = las, np = ++ tot;
		las = np;
		len[np] = len[p] + 1;
		while (p && !ch[p][c]) ch[p][c] = np, p = fa[p];
		if (!p) fa[np] = 1;
		else {
			int q = ch[p][c];
			if (len[q] == len[p] + 1) fa[np] = q;
			else {
				int nq = ++ tot;
				fa[nq] = fa[q], Cpy(ch[nq], ch[q]);
				len[nq] = len[p] + 1, fa[q] = fa[np] = nq;
				while (p && ch[p][c] == q) ch[p][c] = nq, p = fa[p];
			}
		}
		sz[np] = 1;
	}

	void dfs(int u)
	{
		rep(i, SZ(vct[u])) dfs(vct[u][i]), sz[u] += sz[vct[u][i]];
		chkmax(Ans[len[u]], sz[u]);
	}

}sam;

int main()
{
#ifdef hany01
	File("substrings");
#endif

	//Init
	scanf("%s", s + 1);
	n = strlen(s + 1);
	For(i, 1, n) sam.extend(s[i] - 97);

	//Calc
	For(i, 1, sam.tot) vct[sam.fa[i]].pb(i);
	sam.dfs(1);
	Fordown(i, n - 1, 1) chkmax(Ans[i], Ans[i + 1]);
	For(i, 1, n) printf("%d\n", Ans[i]);

    return 0;
}
//黄河之水天上来，奔流到海不复回。
//    -- 李白《将进酒》