<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zawedx的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zawedx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zawedx]]></copyright><item><title><![CDATA[最小回文分解NlogN算法]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/79916046</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/79916046</guid><author>zawedx</author><pubDate>Thu, 12 Apr 2018 16:34:29 +0800</pubDate><description><![CDATA[本文翻译自这篇论文 
译者水平有限，如有错漏，还望指出 
论文中有伪代码可以帮助理解 
众所周知，字符串的border有和等差数列相关的一些性质（border group），可以参考2015年集训队论文集里的《浅谈字符串匹配的几种方法》一文，回文串的回文border也有类似的性质。

tips： 
真后缀定义类似真子集

下面给出算法所用到的几个引理 
引理1 
令y为回文串x的后缀，y是x的bo...]]></description><category></category></item><item><title><![CDATA[一些常用define]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/79327721</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/79327721</guid><author>zawedx</author><pubDate>Thu, 15 Feb 2018 10:21:55 +0800</pubDate><description><![CDATA[#define rep(a,b,c) for (int a=b;a&amp;lt;=c;a++)
#define per(a,b,c) for (int a=b;a&amp;gt;=c;a--)
#define go(u) for (int o=ft[u],v;v=E[o].t,o;o=E[o].n) // forEdge
#define fi first
#define se second // pair
#d...]]></description><category></category></item><item><title><![CDATA[STL 常数测试（粗略）]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/79161367</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/79161367</guid><author>zawedx</author><pubDate>Thu, 25 Jan 2018 14:21:19 +0800</pubDate><description><![CDATA[

vector - 手写链表
预处理log - math库log




vector - 手写链表

vector和手写链表的时间对比 
push_back时间如下




  ..
  不开O2
  开O2



  vector
  8s
  6s


  手写链表
  4s
  4s




遍历一次的时间都是2s 
详见代码



#pragma GCC optimize(2)
#in...]]></description><category></category></item><item><title><![CDATA[Min_25筛代码]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/79154257</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/79154257</guid><author>zawedx</author><pubDate>Wed, 24 Jan 2018 18:43:21 +0800</pubDate><description><![CDATA[Sn=∑i=1nfiSn=∑i=1nfi
S_n=\sum_{i=1}^nf_i
 
Fn=∑i=1n[i为质数]fiFn=∑i=1n[i为质数]fi
F_n=\sum_{i=1}^n[i为质数]f_i
 
Sn,k=∑i=k∑j=1[n≤pj+1i](Snpji,i+1fpji+fpj+1i)+Fn−Fpk−1Sn,k=∑i=k∑j=1[n≤pij+1](Snpij,i+1fpij+fpij+1...]]></description><category></category></item><item><title><![CDATA[NOIP2017总结]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/78545833</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/78545833</guid><author>zawedx</author><pubDate>Wed, 15 Nov 2017 22:26:00 +0800</pubDate><description><![CDATA[学文化课使我快乐O(U_U)O]]></description><category></category></item><item><title><![CDATA[BZOJ八月月赛题解]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/78149595</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/78149595</guid><author>zawedx</author><pubDate>Mon, 02 Oct 2017 00:42:23 +0800</pubDate><description><![CDATA[RT]]></description><category></category></item><item><title><![CDATA[纪中八月五号到二十五号集训总结]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/77587550</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/77587550</guid><author>zawedx</author><pubDate>Sat, 26 Aug 2017 14:06:49 +0800</pubDate><description><![CDATA[回到家一个人真是无聊，只能总结一波
然而晚上没弄完。。]]></description><category></category></item><item><title><![CDATA[记录一下]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/76026475</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/76026475</guid><author>zawedx</author><pubDate>Mon, 24 Jul 2017 16:41:37 +0800</pubDate><description><![CDATA[

LCT
SAM
FWT
2-sat  tarjan缩环
Matrix-Tree
Burnside,Polya
二次剩余Cipolla算法
多项式插值求值
Min_25筛
kosaraju算法
拟阵与贪心
好用的编辑器草稿纸草稿纸^{_{_{草稿纸}}}:  typora
自适应辛普森积分
minHash
四边形不等式
min25阶乘模大质数
OldDriverTree(ODT)
扩展BSGS
...]]></description><category></category></item><item><title><![CDATA[【JZOJ2702】探险]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/75807142</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/75807142</guid><author>zawedx</author><pubDate>Sat, 22 Jul 2017 20:54:05 +0800</pubDate><description><![CDATA[一道不错的最短路题？]]></description><category></category></item><item><title><![CDATA[动态的树链剖分]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/75287131</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/75287131</guid><author>zawedx</author><pubDate>Tue, 18 Jul 2017 11:40:31 +0800</pubDate><description><![CDATA[UPD 18/1/25假的假的！今天突然发现漏掉了细节，暂时想不到解决方法，这个算法凉了不过用启发式合并去重构小LCT应该不用换根了，但不知道复杂度会不会出问题--------------------------------------------------这里的技巧可能没你们想的那么强大。。但我之前也没听过这样用的，觉得可以拿来说一说在各个LCT维护的题中，有些题目不需要cut操作，其实有cu...]]></description><category></category></item><item><title><![CDATA[纪中5号~16号集训小结]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/75220033</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/75220033</guid><author>zawedx</author><pubDate>Mon, 17 Jul 2017 10:33:23 +0800</pubDate><description><![CDATA[啦啦啦]]></description><category></category></item><item><title><![CDATA[SAM模板]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/75095176</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/75095176</guid><author>zawedx</author><pubDate>Fri, 14 Jul 2017 07:32:06 +0800</pubDate><description><![CDATA[SAM真短]]></description><category></category></item><item><title><![CDATA[三道NOIP(?)巧题]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/74932751</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/74932751</guid><author>zawedx</author><pubDate>Mon, 10 Jul 2017 19:35:51 +0800</pubDate><description><![CDATA[C_SUNSHINE 出的NOIP题好妙啊]]></description><category></category></item><item><title><![CDATA[LCT模板]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/74906424</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/74906424</guid><author>zawedx</author><pubDate>Sun, 09 Jul 2017 21:54:24 +0800</pubDate><description><![CDATA[LCT真难调]]></description><category></category></item><item><title><![CDATA[GDOI2017滚粗记]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/70224723</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/70224723</guid><author>zawedx</author><pubDate>Tue, 18 Apr 2017 09:46:24 +0800</pubDate><description><![CDATA[滚粗记]]></description><category></category></item><item><title><![CDATA[网络流模板（费用流/可行流/上下界）]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/69567853</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/69567853</guid><author>zawedx</author><pubDate>Fri, 07 Apr 2017 15:53:05 +0800</pubDate><description><![CDATA[终于来写博客了= =


一般的最大流
算法：dinic          博主只会这个
大概就是先bfs分层，在增广的时候只走跨层边
加当前弧优化好像快10倍左右，加的时候小心点，容易错
应该只有我会写成暴力吧


struct edge{int t,f,n;}E[M];
void add(int x,int y,int f){
	E[++tot]=(edge){y,f,ft]]></description><category></category></item><item><title><![CDATA[GDKOI2017酱油记]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/56018662</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/56018662</guid><author>zawedx</author><pubDate>Mon, 20 Feb 2017 19:13:22 +0800</pubDate><description><![CDATA[考试过程
DAY1
因为监考老师不给提前碰键盘，就只能坐等比赛开始了
其实我是感觉很爽的，因为我没板子可敲
解压密码：zha.xi.de.le~       虽然场上还不知道什么意思
但讲题的时候还是感受到了出题人的善意=w=
发题后大概30分钟读完题目，出题人并没有把水题藏后面，于是从第一题开始做
第一题
想了一会儿，觉得从人开始宽搜炸弹就会好写些
因为这种题我认为不太适合对拍]]></description><category></category></item><item><title><![CDATA[非旋转treap模板]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/54706561</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/54706561</guid><author>zawedx</author><pubDate>Tue, 24 Jan 2017 11:35:01 +0800</pubDate><description><![CDATA[先挑个好讲一点的试试，原理什么的我最多一句带过就算了
你问我无旋treap的原理?我只能回答你一句无可奉告

我学这个东西的时候，想找别人的代码看看
看到别人写得那么长，就自己写了下
然后，就写成现在这样了
----------------------------------------------------------------------------------
#defin]]></description><category></category></item><item><title><![CDATA[短期计划，周更]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/54696511</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/54696511</guid><author>zawedx</author><pubDate>Mon, 23 Jan 2017 22:47:15 +0800</pubDate><description><![CDATA[我相信我一定能完成的(ง •_•)ง2017/9/21matrix-tree 定理bzoj4126国王奇遇记bzoj八月月赛  9/92017/10/2炫酷反演魔术-VFKCM-二项式系数2017/10/21集训队作业 21/1042017/11/1支配树2017/12/7？？月更的我应该还有救VP一场bzoj12月月赛复习：splay，ac自动机，后缀自动机，LCT，网络流2018/2/10点分...]]></description><category></category></item><item><title><![CDATA[CV1873 树的点分治]]></title><link>https://blog.youkuaiyun.com/zawedx/article/details/53609022</link><guid>https://blog.youkuaiyun.com/zawedx/article/details/53609022</guid><author>zawedx</author><pubDate>Tue, 13 Dec 2016 14:10:24 +0800</pubDate><description><![CDATA[题解：
    什么情况点i会对点j做贡献？在i~j路径上的点中，点j最先被选中，概率是dis(i,j)+1
    答案=∑{1/[dis(i,j)+1]}
              i,j
    点分+FFT算出距离为1~n的点对数即可
    （你见过像我这样缩行的吗？）


AC code

#include
#include
using namespace std]]></description><category></category></item></channel></rss>