SugarSBN-CSDN博客

原创 [JSOI2018]D1T2 iiidx [线段树+二分]

显然题意可以抽象成：一棵树，要对树上的每个点标上给定的权值，满足每个点上的权值都≤\leq≤子树内点的权值，并使这个棵树编号从小到大的权值字典序最大。首先可以一眼得到一个做法，将权值从大到小排序，把长度为子树大小的一段按子树编号从小到大丢给它们，递归下去得到答案。这种做法在did_idi不重复的时候是正确的，那did_idi要是有相同的数呢？有可能可以将编号xxx子树里一个大...

2018-05-25 18:47:24 205

原创 [JSOI2018] D1T1 chess [对抗搜索][状压DP]

/* * @Author: SugarSBN * @Date: 2018-05-21 21:54:00 * @Language: C++ * @Task: chess */#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include&l...

2018-05-25 18:45:41 224

原创【法法塔】【FFT】【快速傅里叶离散变化】luogu P1919 P3803

迭代实现// luogu-judger-enable-o2#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cstring>#include<set>#include<map>#include

2018-05-12 15:23:41 260

原创 [Codeforces][976D] 图的构造 Educational Codeforces Round 43 (Rated for Div. 2) D. Degree Set

超喜欢这题的说题目大意：给你一个正整数集，其中最大数为n，求构造一个图，使得有n+1个结点且这个图的结点的度组成的集合等于所给集合这题在加里·查特兰所著的《图论----一个迷人的世界中》出现在定理2.3.不过这本书好像挺难找的书上大意写了下，我看了半天马马虎虎理解，然后自己YY着想出了构造方法构造图最有趣了是这样的，我们假设要构造一个度集为{d}（d1<d2<d3<......

2018-05-01 20:35:16 328

原创【带修莫队】【国家集训队】数颜色

/* Luogu P1903 数颜色 by sbn 2018-4-25 */#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cstring>#include<queue>#include<...

2018-04-25 20:04:18 147

原创【模板】 Splay luogu3391

/* Splay luogu P3391 by sbn 2018-4-2 */ #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<map>#include<algorithm>#include&lt...

2018-04-02 20:37:19 139

原创【树链剖分】【模板】

/* P3384 树链剖分 by sbn 2018-3-31 */ #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cstring>#include<queue>#include<vect...

2018-03-31 22:19:06 83

原创【线段树】标记永久化

/* Segment tree 标记永久化 by sbn 2018-3-30 */ #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<queue>#include...

2018-03-30 22:36:34 587

转载【线段树】来自xuzihanlla “http://www.cnblogs.com/xuzihanllaa/p/8324871.html” 好写不易错

一、线段树是什么？1.我们为什么要使用线段树？如果只是为了维护一个序列本身，直接用数组就行了，不必使用线段树，就好比能用线段树的时候没必要码个treap上去。线段树的核心作用是维护一个序列的信息，当然这个信息不是什么都行，必须满足区间加法（见ZKW的PPT《统计的力量》）。e.g.可以维护区间和，区间平方和，区间方差等等（都是些基础运用）。2.线段树支持哪些操作？即便是最低级的线段树也应该支持单点...

2018-03-29 20:19:32 167

原创【模板】【p3379】【LCA】倍增（好写好用）

/* LCA Luogu P3379 algorithm:倍增 by sbn first edition 2018-3-21 */ #include<iostream>#include<cstdio>#include<cstdlib>#include<ctime>#include<cstring>#include&...

2018-03-21 22:08:50 136

原创【Treap模板】【指针】【luogu3369】

/* Treap luogu3369 by sbn*/#include<iostream>#include<cstdio>#include<cstdlib>#include<ctime>#include<cstring>#include<string>#include<algori...

2018-03-21 19:14:03 224

转载强连通分量模板+DAGdp 洛谷P3387

/* luogu P3387 缩点（强连通分量）+DAGdp by sbn 2018-2-11 algorithm：Kosaraju */#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#...

2018-02-11 16:05:55 347

原创【P2661】信息传递【并查集】查找最小环

/* 信息传递 P2661 有向图最小环 algorithm:并查集 by sbn 2018-1-14*/#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<algorithm>

2018-01-14 18:17:50 792

原创 Hash 线段树离散化

inline void hash_init(){ Hash.clear(); for (int i=1;i<=n;i++) { Hash.pb(a[i].first); Hash.pb(a[i].first+1); Hash.pb(a[i].second); Hash.pb(a[i].second+1);

2018-01-12 21:17:24 176

原创 BIT应用逆序对 POJ2299

/* POJ2299 BIT+逆序对 by sbn 2018-1-12*//* 59105431230*/#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<vector>#include<algorithm>#define

2018-01-12 21:12:52 157

原创 BIT简单版

/* BIT by sbn 2017-12-30 P3374*/#include<iostream>#include<cstdio>#include<cstdlib>using namespace std;int C[2000010],n,m;int lowbit(int x){ return x & -x;}int add(int x,in

2017-12-30 20:23:11 115

原创主席树+动态开点

/* the k-th number 主席树+动态开点 by sbn 2017-12-26 */#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>using namespace std;typedef long long ll;str

2017-12-26 22:07:15 478

原创 RMQ区间最值（STdp）

/* RMQ区间最值 ST DP by sbn*/#include<iostream>#include<cmath>#include<cstdio>using namespace std;int n,m;long long a[1000001],dp[1000001][100];int main(){ //freopen("rmq.in","r",st

2017-12-25 19:55:00 148

原创 RMQ区间最值（线段树）

/* RMQ区间最值线段树版 by sbn*/#include<iostream>#include<cstdio>using namespace std;int n;int arr[1000001],tree[2000001];void build(int root,int st,int ed){ if (st==ed) tree[root]=

2017-12-25 19:53:55 190

原创最近公共祖先LCA tarjan

/* 最近公共祖先LCA tarjan by sbn*/#include<iostream>#include<cstdio>#include<cstring>using namespace std;struct edge{ int x,y,nxt; edge(){} edge(int nx,int ny,int nn

2017-12-25 19:52:50 133

原创线段树区间乘法+区间加法

/* 线段树区间乘法+区间加法 by sbn*/#include<iostream>#include<cstdio>using namespace std;typedef long long ll;ll n,m,p,z;ll arr[100001];struct node{ ll l,r; ll sum,add,mul;} tree[

2017-12-25 19:51:36 1224

原创高斯消元

/* 高斯消元 by sbn*/#include<iostream>#include<cstdio>using namespace std;double matrix[101][102];int n;double res[101];void debug(){ for (int i1=1;i1<=n;i1++) {

2017-12-25 19:50:34 130

原创割点判断（tarjan）

/* 割点判断 tarjan by sbn*/#include<iostream>#include<cstdio>using namespace std;struct node{ int x,y,nxt; node(){} node(int nx,int ny,int nnxt){ x=

2017-12-25 19:49:14 908

原创二分图匹配（匈牙利算法）

/* 二分图匹配匈牙利 by sbn*/#include<iostream>#include<cstdio>#include<cstring>using namespace std;bool map[1001][1001];int n1,n2,m;int flag[1001],vis[1001];bool dfs(int x){ for (int i

2017-12-25 19:47:55 90

原创 Dinic+当前弧优化

/* 最大流 Dinic by sbn 2017-12-24 */#include<iostream>#include<cstdio>#include<cstdlib>#include<string>#include<queue>#include<cstring>#define min(x,y) ((x<y)?(x):(y))#define rev(

2017-12-25 19:46:15 188

原创最大流Dinic（没有当前弧优化）

/* 最大流 Dinic by sbn 2017-12-24 */#include<iostream>#include<cstdio>#include<cstdlib>#include<string>#include<queue>#include<cstring>#define min(x,y) ((x<y)?(x):(y))#define rev(

2017-12-24 22:04:12 172

转载线段树离散化

/* 线段树离散化 by sbn */#include<iostream>#include<string>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<vector>using namespace std;#define pb push_back#define mp

2017-12-24 16:00:35 212

转载可持久化线段树（主席树）

/* 可持久优化线段树 POJ2104 区间第k大值 k-th number by sbn 2017-12-21 */#include<iostream>#include<cstdio>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;typedef long

2017-12-24 16:00:06 87

转载 KMP

/* kmp luogu p3375 by sbn 2017-12-24*/#include<iostream>#include<cstdio>#include<cstdlib>#include<string>#include<cstring>using namespace std;string s1,s2;int

2017-12-24 15:59:20 95

转载 AC自动机简单版

/* AC自动机 by sbn p 3808 2017-12-24*/#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<queue>#include<algorithm>using namespace std;typ

2017-12-24 15:57:07 117

u014681071的博客