摘要:
树链剖分,差不多就是树上分块 核心思想:利用dfs序的连续性,把链和子树套在线段树上做 代码略长,记得随时取模 #include<iostream> #include<cstdio> #define ri register int #define u int namespace opt { inli 阅读全文
posted @ 2019-11-06 21:34
pai_hoo
阅读(109)
评论(0)
推荐(0)
摘要:
区间dp板题 #include<iostream> #include<cstdio> #define ri register int #define u int namespace opt { inline u in() { u x(0),f(1); char s(getchar()); while 阅读全文
posted @ 2019-11-06 16:26
pai_hoo
阅读(138)
评论(0)
推荐(0)
摘要:
完全背包板子 #include<iostream> #include<cstdio> #define ri register int #define u long long namespace opt { inline u in() { u x(0),f(1); char s(getchar()); 阅读全文
posted @ 2019-11-06 15:58
pai_hoo
阅读(148)
评论(0)
推荐(0)
摘要:
01背包 #include<iostream> #include<cstdio> #define ri register int #define u int namespace opt { inline u in() { u x(0),f(1); char s(getchar()); while(s 阅读全文
posted @ 2019-11-06 15:50
pai_hoo
阅读(185)
评论(0)
推荐(0)
摘要:
dp维度优化 优化 :y=i-x #include<iostream> #include<cstdio> #define ri register int #define u int namespace opt { inline u in() { u x(0),f(1); char s(getchar 阅读全文
posted @ 2019-11-06 15:29
pai_hoo
阅读(118)
评论(0)
推荐(0)
摘要:
手动哈希 前缀和 比较字符串是否相同 #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define ri register int #define u unsigned long long #def 阅读全文
posted @ 2019-11-06 13:49
pai_hoo
阅读(88)
评论(0)
推荐(0)

浙公网安备 33010602011771号