阅读背景:

HDU-3374-StringProblem(最小表示法,KMP)

来源:互联网 

连接:

https://vjudge.net/problem/HDU-3374

题意:

Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings:Giv




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: