 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
贡献数据,顺便说下题意6 6 2 5 1 2 3 1 5 2 3 1 5 1 2 答案:2 3 3 1 1 1 1 1 1 1 答案:1 题目意思就是问S1中有多少个长度为K的子串在S2中刚好存在,且再加上后一个字符形成的子串在S2中不存在. 也就是求S1的后缀有多少个和"S2中所有后缀的LCP值中最大的"值为K. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
