2016年2月24日
后缀自动机(SAM) ：SPOJ LCS - Longest Common Substring
摘要： LCS - Longest Common Substring no tags A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lower 阅读全文
posted @ 2016-02-24 22:52 TenderRun 阅读(191) 评论(0) 推荐(0)
图论(A*算法，K短路) ：POJ 2449 Remmarguts' Date
摘要： Remmarguts' Date Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 25216 Accepted: 6882 Description "Good man never makes girls wait or break 阅读全文
posted @ 2016-02-24 22:04 TenderRun 阅读(230) 评论(0) 推荐(0)