SDOI R1 day2 T1 生成魔咒 后缀自动机

今天的测试T1，写的我一脸懵逼，还好1h+调过去了

显然的我们沿着新加入的边跑跑就行了，于是考场上A掉了

/* ***********************************************
Author        :BPM136
Created Time  :2016-4-25 8:26:45
File Name     :A.cpp
************************************************ */

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<queue>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<vector>
#include<functional>
#include<numeric>
#include<memory>
#include<iterator>
#define LL long long
#define DB double
#define LB long double
#define UL unsigned long
#define ULL unsigned long long
#define pb push_back
#define popb pop_back
#define get(a,i) a&(1<<(i-1))
#define PAU putchar(32)
#define ENT putchar(10)
#define clr(a,b) memset(a,b,sizeof(a))
#define fo(_i,_a,_b) for(int _i=_a;_i<=_b;_i++)
#define fd(_i,_a,_b) for(int _i=_a;_i>=_b;_i--)
#define efo(_i,_a) for(int _i=last[_a];_i!=0;_i=e[_i].next)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
#define filein(x) freopen(#x".in","r",stdin)
#define fileout(x) freopen(#x".out","w",stdout)
#define mkd(x) freopen(#x".in","w",stdout);
#define setlargestack(x) int size=x<<20;char *p=(char*)malloc(size)+size;__asm__("movl %0, %%esp\n" :: "r"(p));
#define end system("pause")
using namespace std;
LL read()
{
         LL f=1,d=0;char s=getchar();
         while (s<48||s>57){if (s==45) f=-1;s=getchar();}
         while (s>=48&&s<=57){d=d*10+s-48;s=getchar();}
         return f*d;
}
LL readln()
{
       LL f=1,d=0;char s=getchar();
       while (s<48||s>57){if (s==45) f=-1;s=getchar();}
       while (s>=48&&s<=57){d=d*10+s-48;s=getchar();}
       while (s!=10) s=getchar();
       return f*d;
}
inline void write(LL x)
{
    if(x==0){putchar(48);return;}if(x<0)putchar(45),x=-x;
    int len=0,buf[20];while(x)buf[len++]=x%10,x/=10;
    for(int i=len-1;i>=0;i--)putchar(buf[i]+48);return;
}
inline void writeln(LL x){write(x);ENT;}

const int MOD = 41;
const int N = 1001001;

LL ans=0;
int n;

struct node {
	map<int, node*>ch;
	node *par;
	int val;
}t[N];

node *last,*root;

int to = 0;

node* newnode(int x) {
	node *k = t+ (to ++);
	k->val = x;
	k->par = NULL;
	k->ch.clear();
	return k;
}

LL get_ans(node *p) {
	return p->val - p->par ->val;
}

void insert(int x) {
	node *p = last , *np = newnode(p->val + 1);
	while(p && !p->ch[x]) {
		p->ch[x] = np, p = p->par;
	}

	if(!p) np -> par = root, ans += get_ans(np);
	else {
		node *q = p->ch[x];
		if(q->val == p->val + 1) {
			np->par = q, ans += get_ans(np);
		} else {
			node *nq = newnode(p->val + 1);
			nq->ch = q->ch;
			nq->par = q->par; ans += get_ans(nq);
			np->par = nq;     ans += get_ans(np);
			ans -= get_ans(q); q->par = nq;
			ans += get_ans(q);
			while (p && p->ch[x] == q) {
				p->ch[x] = nq, p = p->par;
			}
		}
	}
	last = np;
}

void init() {
	root = newnode(0);
	last = root;
	n = read();
}

void work() {
	fo(i, 1, n) {
		int x=read();
		insert(x);
		writeln(ans);
	}
}

int main() {
	file(incantation);
	init();
	work();
	return 0;
}