Unverified Commit 3437e114 authored by XLor's avatar XLor Committed by GitHub
Browse files

Update docs/string/sam.md



Co-Authored-By: default avatarouuan <1609483441@qq.com>
parent 72a622d2
Loading
Loading
Loading
Loading
+1 −1
Original line number Diff line number Diff line
@@ -359,7 +359,7 @@ $$

另一种方法是利用上述后缀自动机的树形结构。每个节点对应的子串数量是 $len(i)-len(link(i))$ ,对自动机所有节点求和即可。

例题: [【模板】后缀自动机](https://www.luogu.org/problem/P3804)[SDOI2016 生成魔咒](https://www.luogu.org/problem/P4070) 
例题: [【模板】后缀自动机](https://www.luogu.org/problem/P3804)[SDOI2016 生成魔咒](https://loj.ac/problem/2033) 

### 所有不同子串的总长度