 |
| ||||
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 | |||||||||
后缀数组算最大重复次数 然后暴力查找字典序最小数据水了 没防这种暴力法 但是 如果第二次暴力查找的过程改用链表 保证每个点开头都只探测到一次的话 这个算法就是O(n)的+O(nlogn)RMQ的了 比较麻烦 不实现了 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
