Cyhlnj

KMP暴力求出next数组后 实际上是一个最短路问题，floyed搞一搞 然而会TLE 矩阵优化一下即可（倍增floyed） KMP在弱数据下可以AC。。正解请看其他人博客# include <stdio.h> # include <stdlib.h> # include <iostream> # include <algorithm> # include <string.h> # defi

map+floyed+矩阵乘法（倍增floyed）# include <stdio.h> # include <stdlib.h> # include <iostream> # include <algorithm> # include <string.h> # include <map> # define IL inline # define RG register # define Fill(a