P4070 [SDOI2016] 生成魔咒

#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL in() {
	char ch; int x = 0, f = 1;
	while(!isdigit(ch = getchar()))(ch == '-') && (f = -f);
	for(x = ch ^ 48; isdigit(ch = getchar()); x = (x << 1) + (x << 3) + (ch ^ 48));
	return x * f;
}
const int maxn = 2e5 + 5;
struct SAM {
protected:
	struct node {
		node *fa;
		std::map<int, node*> ch;
		int len, siz;
		node(int len = 0, int siz = 0): fa(NULL), len(len), siz(siz) {
			ch.clear();
		}
	};
	node *root, *tail, *lst;
	node pool[maxn];
	void clr() {
		tail = pool;
		root = lst = new(tail++) node();
	}
public:
	SAM() { clr(); }
	node *extend(int c) {
		node *o = new(tail++) node(lst->len + 1, 1), *v = lst;
		for(; v && !v->ch[c]; v = v->fa) v->ch[c] = o;
		if(!v) o->fa = root;
		else if(v->len == v->ch[c]->len - 1) o->fa = v->ch[c];
		else {
			node *n = new(tail++) node(v->len + 1), *d = v->ch[c];
			n->ch = d->ch;
			n->fa = d->fa, d->fa = o->fa = n;
			for(; v && v->ch[c] == d; v = v->fa) v->ch[c] = n;
		}
		return lst = o;
	}
}sam;
int main() {
	int n = in();
	LL ans = 0;
	for(int i = 1; i <= n; i++) {
		auto o = sam.extend(in());
		ans += o->len - o->fa->len;
		printf("%lld\n", ans);
	}
	return 0;
}