摘要: 链接:https://www.nowcoder.com/acm/contest/141/J 题目描述 Eddy has graduated from college. Currently, he is finding his future job and a place to live. Since 阅读全文
posted @ 2018-07-31 21:24 灬从此以后灬 阅读(278) 评论(0) 推荐(0) 编辑
摘要: 链接:https://www.nowcoder.com/acm/contest/141/E 题目描述 Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a s 阅读全文
posted @ 2018-07-31 17:36 灬从此以后灬 阅读(206) 评论(0) 推荐(0) 编辑
摘要: Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 48387 Accepted: 19261 Description The French author Georges Perec (1936–1982) once w 阅读全文
posted @ 2018-07-31 15:23 灬从此以后灬 阅读(251) 评论(0) 推荐(0) 编辑
摘要: KMP算法: 一:next数组:next[i]就是前面长度为i的字符串前缀和后缀相等的最大长度,也即索引为i的字符失配时的前缀函数。 二:KMP模板 1 /* 2 pku3461(Oulipo), hdu1711(Number Sequence) 3 这个模板 字符串是从0开始的 4 Next数组是 阅读全文
posted @ 2018-07-31 13:39 灬从此以后灬 阅读(225) 评论(0) 推荐(0) 编辑