后缀数组
mengbi_er
一个蒟蒻JLoier
展开
-
bzoj1717: [Usaco2006 Dec]Milk Patterns 产奶的模式
求后缀数组,二分答案,有超过k个连续height>=mid 就符合。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;int read(){ char ch=getchar();int f=0; while(ch原创 2017-09-05 14:20:30 · 239 阅读 · 0 评论 -
bzoj2946: [Poi2000]公共串
将所有串连起来,中间加一个分隔符,二分答案,有连续ht>=mid且每个串中都出现一次就合法,否则不合法,一定要将分隔符特判掉,否则=0会输出1。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar()原创 2017-09-08 18:16:49 · 269 阅读 · 0 评论 -
【模板】后缀数组
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<ctime>using namespace std;#define N 2000006int sa1[N],sa2[N],rk1[N],rk2[N],v[N];int *sa,*SA,*rk,*RK;bool ac=0;cha转载 2017-10-16 16:15:42 · 223 阅读 · 0 评论