P4248 [AHOI2013]差异（单调栈，后缀数组height[]）

设$lcp(i,j)=min(height[i],height[j])=height[k]$
问题转化为了求每个height[k]的贡献：即height[k]在多大的区间内是最小的，单调一下就好了。

const int N = 5e5+10, M = 30;
char s[N];
int sa[N], t[N << 1], t2[N << 1], c[N], height[N], rk[N];
int n, m;
void get_sa()
{
	//s从1开始，排名从1开始
	int i, *x = t, *y = t2, m = 256;
	for (i = 1;i <= m;i++)c[i] = 0;
	for (i = 1;i <= n;i++)c[x[i] = s[i]]++;
	for (int i = 2;i <= m;i++)c[i] += c[i - 1];
	for (i = n;i;i--)sa[c[x[i]]--] = i;
	for (int k = 1;k <= n;k <<= 1)
	{
		int num = 0;
		for (i = n - k + 1;i <= n;i++)y[++num] = i;
		for (i = 1;i <= n;i++)if (sa[i] > k)y[++num] = sa[i] - k;
		for (i = 1;i <= m;i++)c[i] = 0;
		for (i = 1;i <= n;i++)c[x[i]]++;
		for (i = 2;i <= m;i++)c[i] += c[i - 1];
		for (i = n;i;i--)sa[c[x[y[i]]]--] = y[i];
		swap(x, y);
		x[sa[1]] = 1;num = 1;
		for (int i = 2;i <= n;i++)
			x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++num;
		if (num == n)break;
		m = num;
	}
}
void get_height()
{
	int k = 0;
	for (int i = 1;i <= n;i++)rk[sa[i]] = i;
	for (int i = 1;i <= n;i++)
	{
		if (rk[i] == 1)continue;
		if (k)k--;
		int j = sa[rk[i] - 1];
		while (j + k <= n && i + k <= n && s[i + k] == s[j + k])k++;
		height[rk[i]] = k;
	}
}
int l[N << 1], r[N << 1];
int main()
{
	//freopen("in.txt", "r", stdin);
	scanf("%s", s + 1);
	n = strlen(s + 1);
	ll ans = (ll)(n - 1) * n * (n + 1) / 2;
	get_sa();
	get_height();
	//设lcp(i,j)=min(height[i],height[j])=height[k]
	//问题转化为了求每个height[k]的贡献：及height[k]在多大的区间内是最小的
	deque<pii> dq;
	//考虑height直方图
	/*
	ao    0
	acao  1
	cao   0
	cacao 2
	o     0
	*/
	//f(i, 1, n)debug(height[i]);
	height[1] = height[n + 1] = -inf;
	dq.push_back(pii{ 1,height[1] });
	//1 2 2 1,一边取等号，一边不取保证区间最小不交
	f(i, 2, n)
	{
		while (dq.back().second > height[i])
			dq.pop_back();
		l[i] = dq.back().first;
		dq.push_back(pii{ i,height[i] });
	}
	dq.clear();
	dq.push_back(pii{ n + 1,height[n + 1] });
	ff(i, n, 2)
	{
		while (dq.back().second >= height[i])
			dq.pop_back();
		r[i] = dq.back().first;
		dq.push_back(pii{ i,height[i] });
	}
	f(i, 2, n)ans -= (ll)(r[i] - i)*(i - l[i])*height[i] * 2;
	cout << ans << endl;
	return 0;
}