？？
by star_city @ 2019-03-24 10:00:16
@[star_city](/space/show?uid=47421) 后缀机的endpos啊
by 樱初音斗橡皮 @ 2019-03-24 10:01:20
您怎么天天秀啊
by xiaolou @ 2019-03-24 10:02:57
@[xiaolou](/space/show?uid=68675) 窝哪里秀了QWQ窝只是不懂
by 樱初音斗橡皮 @ 2019-03-24 10:03:43
endpos就是val吧
by ciwomuli @ 2019-03-24 10:05:01
我的代码
```cpp
void add(int w){
int p=last,np=++sz;
val[np]=val[p]+1;
siz[np]=1;
while(p && nxt[p][w]==0)
nxt[p][w]=np,p=par[p];
if(p==0) par[np]=root;
else{
int q=nxt[p][w];
if(val[q] == val[p]+1){
par[np]=q;
}else{
int nq=++sz;
val[nq]=val[p]+1;
memcpy(nxt[nq],nxt[q],sizeof(nxt[q]));
par[nq]=par[q];
par[q]=par[np]=nq;
while(p && nxt[p][w]==q)
nxt[p][w]=nq,p=par[p];
}
}
last = np;
}
```
by ciwomuli @ 2019-03-24 10:06:45
Emmm
by xiaolou @ 2019-03-24 10:07:16
@[ciwomuli](/space/show?uid=31228) QWQ谢谢~~看不懂，再听听课~~
by 樱初音斗橡皮 @ 2019-03-24 10:08:28
@[ciwomuli](/space/show?uid=31228) 后来老师说了，endpos是不能求得QWQ
by 樱初音斗橡皮 @ 2019-03-24 10:15:01
@[樱初音斗橡皮](/space/show?uid=66287) endpos不是可以线段树合并么
by Itst @ 2019-03-24 10:23:47