退役狗的专栏

必须学计算几何了……muba

const int maxn=2005;struct edge{int u,v,cap,flow;};vectoredges;vectorG[maxn];int s,t;int cur[maxn],d[maxn];void add(int u,int v,int cap){ edges.push_back((edge){u,v,cap,0}); G[u].push_back(edg

传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=3172后缀数组模板题Code:#include#define fst first#define sec secondusing namespace std;typedef pair pi;const int maxn=1e6+205;pi tmp[maxn];int

传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=2594其实以前都是背模板……彻底的学习一下LCTCode:#include#define V(x) (LCT::pool+x)#define E(x) (LCT::pool+n+x)using namespace std;const int maxn=100010;con

传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=3172指针模板Code:#include#define idx(c) (c-'a')using namespace std;const int maxn=205;const int maxlen=1e6+205;int n,len,anss[maxn];char s[m

传送门:http://acm.hdu.edu.cn/showproblem.php?pid=2222裸·AC自动机Code:#include#include#include#include#include#include#include#define idx(c) (c-'a')using namespace std;typedef unsigned long lon

贴一个模板#include#include#includeusing namespace std;const int maxn=1e6+5;int next[maxn],slen,tlen;char s[maxn],t[maxn];int kmp(){ int ans=0; for(int i=2,j=next[1]=0;i<=tlen;++i){ while(j&&t[

syntax on "开启高亮set background=light "背景set showcmd " 显示命令set mouse=aset selection=exclusiveset selectmode=mouse,keyset nu "显示行号set nocp "不兼容模式set cursorline "线set tabstop=4 " 设

好久没写平衡树手生了重打一遍

待更新:Lucas定理线性

最近被好多数论题虐翻……感觉

其实我从小就不喜欢高精度……Code:#includeusing namespace std;const int maxn=1e3+10;typedef long long LL;struct HP{ int len,s[maxn],f; HP(){ clear(); } void clear(){ memset(s,0,sizeof(s)); len=1;f=

有什么错误欢迎指出,只求轻喷……很久以前在众多神犇的鄙视下找到了论文和代码啃了起来由于要准备期末考试于是没有多少时间看但又突然不用期末考试了于是就开始看了唔好像扯得有点远而且一口气读完一长串没有标点符号的句子一定会比很累吧所以就不多扯了首先是AAA树和top tree和self-adjust toptree到底哪个是哪个的问题 = =找到了杜教、翱犇