模板
wspl654321
。。。。。。
展开
-
spfa模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<ctime>#include<cstdlib>#include<algorithm>using namespace std;queue<int> q原创 2017-11-08 20:36:14 · 125 阅读 · 0 评论 -
cdq分治
最简单的就是归并。。。还有三位偏序问题就是两层归并。。。这里第二位cdq分治第三位树状数组维护。。 P3810 【模板】三维偏序(陌上花开)#include<cstdio>#include<algorithm>#define M 210000int n,k,ans[M],f[M],sum[M];using namespace std;stru...原创 2018-02-22 20:57:56 · 125 阅读 · 0 评论 -
模板2
#include<cstdio>#include<cmath>#include<ctime>#include<cstring>#include<queue>#include<set> #include<algorithm>using namespace std;int x,y,a,b;int gcd(int &x,int &y,int a,int b){ if(!b){原创 2017-11-09 16:57:27 · 196 阅读 · 0 评论 -
高精模板
#include<cstdio>#include<cstring>#include<iostream>#define K 10000using namespace std;char a[1100000];struct st{ long long s[5100],tot; void init(){ memset(s,0,sizeof s);原创 2017-11-09 16:52:16 · 217 阅读 · 0 评论 -
lcs模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int n,a[1100000],b[1100000]原创 2017-11-08 20:59:48 · 203 阅读 · 0 评论 -
模板
#include<cstdio>#include<iostream>#include<cstring>#include<cmath>#include<set>#include<map>#include<queue>#include<vector>#include<ctime>#include<cstdlib>#include<algorithm>using namespace原创 2017-11-08 20:35:44 · 165 阅读 · 0 评论 -
最小生成树k算法
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int n,m,opt,x,y,f[1100000],原创 2017-11-08 21:12:28 · 334 阅读 · 0 评论 -
筛素数模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int ip[11000000],pr[1100000原创 2017-11-08 21:11:26 · 155 阅读 · 0 评论 -
优先队列模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;priority_queue<int> q;int原创 2017-11-08 21:11:03 · 162 阅读 · 0 评论 -
并查集模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int n,m,opt,x,y,f[1100000];原创 2017-11-08 21:10:24 · 168 阅读 · 0 评论 -
归并排序模板
#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int n,a[1100000],tmp[110000原创 2017-11-08 20:36:53 · 182 阅读 · 0 评论 -
有问题的左偏树
wa了一点。。。不知为什么 路过的大佬帮忙看一下啦 谢谢啦#include<cstdio>#include<iostream>const int M = 110000;int n,m,A[M];struct node{int ls,rs,h,w,f;}t[M];int merge(int a,int b){ if(!a) return b;if(!b...原创 2018-02-22 20:59:27 · 165 阅读 · 0 评论