随笔分类 -  后缀数组

摘要:题目链接:http://poj.org/problem?id=1743题意:有N(1 2 const int MAXN = 20005; 3 int wa[MAXN], wb[MAXN], wv[MAXN], ws[MAXN]; 4 5 int cmp(int* r, int a, in... 阅读全文
posted @ 2015-05-08 16:42 jasaiq 阅读(920) 评论(0) 推荐(0)