程序猿
程序猿
[HAOI2016]找相同字符
题解:
后缀数组
刚开始以为hash后来发现怎么样都只能n2
两个串连在一起中间加入分隔符
枚举每个点作为最小值
分为前半段和后半段
每次像dp一样扩展就可以了
【推广】
免费学中医,健康全家人
原文地址:https://www.cnblogs.com/yinwuxiao/p/8460287.html
推荐文章
自定义规则总结
ASCII,Unicode和UTF-8字符编码
Unix环境高级编程
webscarab使用
http一问一答
278. First Bad Version
302. Smallest Rectangle Enclosing Black Pixels My Submissions QuestionEditorial Solution
305. Number of Islands II
261. Graph Valid Tree
200. Number of Islands
130. Surrounded Regions
296. Best Meeting Point
286. Walls and Gates
317. Shortest Distance from All Buildings
Apache 下网站首页设定
Major Number
Red-Black Tree
Binary Tree Serialization and Deserialization
2 Sum in Binary Search Tree
Maximum Gap
Find the Smallest K Elements in an Array
Count of Smaller Number
Number of Inversion Couple
Delete False Elements
Sort Array
Tree Diameter
Segment Tree Implementation
Java Programming Mock Tests
zz Morris Traversal方法遍历二叉树(非递归,不用栈,O(1)空间)
Algorithm about SubArrays & SubStrings