随笔分类 -  后缀数组

SPOJ(后缀数组求不同子串个数)
摘要:DISUBSTR - Distinct Substrings Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20;Each 阅读全文

posted @ 2016-03-02 21:54 vCoders 阅读(184) 评论(0) 推荐(0) 编辑

POJ2274(后缀数组应用)
摘要:Long Long Message Time Limit: 4000MS Memory Limit: 131072K Total Submissions: 25272 Accepted: 10345 Case Time Limit: 1000MS Description The little cat 阅读全文

posted @ 2016-03-01 21:34 vCoders 阅读(247) 评论(0) 推荐(0) 编辑

POJ3261(后缀数组+2分枚举)
摘要:Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12972 Accepted: 5769 Case Time Limit: 2000MS Description Farmer John has noti 阅读全文

posted @ 2016-03-01 20:58 vCoders 阅读(312) 评论(0) 推荐(0) 编辑

POJ2217(最长公共子串)
摘要:Secretary Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 992 Accepted: 408 Description The basic condition of success of a political party 阅读全文

posted @ 2016-03-01 17:44 vCoders 阅读(139) 评论(0) 推荐(0) 编辑

导航

点击右上角即可分享
微信分享提示