后缀数组DC3算法实现
摘要:
算法模板:View Code #define F(x) ((x)/3+((x)%3==1?0:tb))#define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)int wa[maxn],wb[maxn],wv[maxn],ws[maxn];int c0(int *r,int a,int b){return r[a]==r[b]&&r[a+1]==r[b+1]&&r[a+2]==r[b+2];}int c12(int k,int *r,int a,int b){if(k==2) return r[a]<r[b]||r[a]== 阅读全文
posted @ 2012-05-30 22:14 More study needed. 阅读(547) 评论(0) 推荐(0) 编辑