oWuHen12的博客

题面：https://www.nowcoder.com/acm/contest/146/H题目描述Niuniu likes playing games. He has n piles of stones. The i-th pile has ai stones. He wants to play with his good friend, UinUin. Niuniu can choose...

题目链接: A String Gamesol:一眼sgsgsg定理，可惜那时候不怎么会后缀自动机，拿后缀数组暴力转移失败对ttt串建立后缀自动机，每个状态结点都表示一种局面，其后继状态即其在自动机上的合法转移结点。拓扑排序后通过sgsgsg定理求出每个结点的sgsgsg值。考虑单个字符串sss，其sgsgsg值即为自动机上sss对应子串结点的sgsgsg值。答案就是所有串的NimNimNi...