![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
字符串
文章平均质量分 78
Lethelody
这个作者很懒,什么都没留下…
展开
-
BZOJ2555【SAM】【LCT】
裸的SAM暴力程序跑得很快./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define原创 2015-04-11 01:47:07 · 651 阅读 · 0 评论 -
BZOJ2258【hash】【二分】
发现插入操作很少,可以每次插入完以后暴力重算hash值。查询的时候二分判断就可以了。/* I will wait for you*/ #include #include #include #include #include #include #include #include #include #include #inclu原创 2015-06-08 10:17:52 · 603 阅读 · 0 评论 -
BZOJ3620【KMP】
/* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-20 15:58:43 · 531 阅读 · 0 评论 -
BZOJ1209【rope】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#原创 2015-05-14 18:02:36 · 453 阅读 · 0 评论 -
BZOJ2434【AC自动机】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define m_p make_pair#define p_b原创 2015-05-15 11:33:07 · 400 阅读 · 0 评论 -
BZOJ1507【rope】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#原创 2015-05-13 16:25:36 · 540 阅读 · 0 评论 -
BZOJ2342【manacher】【set】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-13 11:27:26 · 425 阅读 · 0 评论 -
BZOJ4032【后缀自动机】【序列自动机】
原来还有序列自动机这种神奇的东西./* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make ma原创 2015-05-04 17:09:59 · 1113 阅读 · 0 评论 -
BZOJ3238【后缀数组】【单调栈】
/* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #原创 2015-04-14 16:24:56 · 466 阅读 · 0 评论 -
BZOJ2565【回文自动机】
跑两遍PAM.分别找到每个点做为结尾字符和开始字符的最长回文串的长度./* I will wait for you */#include#include#include#includeusing namespace std;typedef long long LL;typedef unsigned long long ULL;typedef pair PII;cons原创 2015-04-12 10:39:58 · 2074 阅读 · 3 评论 -
BZOJ3676【回文自动机】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define fi first#define原创 2015-04-12 00:41:19 · 477 阅读 · 0 评论 -
BZOJ3271【AC自动机】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define fi first#define原创 2015-04-06 20:02:19 · 532 阅读 · 0 评论 -
BZOJ2938【AC自动机】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define fi first#define原创 2015-04-06 19:54:14 · 436 阅读 · 0 评论 -
BZOJ2754【AC自动机】
可以用map来维护节点的next域.注意不能路径压缩./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_原创 2015-04-06 21:45:10 · 448 阅读 · 0 评论 -
BZOJ4104【乱搞】
对于m是干什么的,实在是不明觉厉。#include #include #include using namespace std;typedef pair pii;pii a[1000005];int main(){ int n, m; scanf("%d%d", &n, &m); for (int i = 0; i <= n; i++)原创 2015-06-09 16:28:12 · 793 阅读 · 0 评论