I and OI
Past...

随笔分类 -  数据结构

待添加.
RMQ ST算法
摘要:const maxn=50001; maxm=trunc(ln(maxn)/ln(2));var f,g:array[0..maxn,0..maxm] of longint; num:array[0..maxn] of longint; n,m,i,j,maxn... 阅读全文
posted @ 2011-11-09 19:15 exponent 阅读(280) 评论(0) 推荐(0)
后缀数组模板
摘要:const maxn=100; maxm=trunc(ln(maxn)/ln(2))+1;var h,sa,rank,tmp,tax:array[0..maxn*2]of longint; f:array[0..maxn,0..maxm] of longint; ... 阅读全文
posted @ 2011-09-25 17:23 exponent 阅读(625) 评论(0) 推荐(0)