杂项 - 随笔分类 - Member

摘要：1、二分图 2、网络流 3、后缀数组 4、概率期望dp 阅读全文

posted @ 2019-02-18 23:30 Member 阅读(133) 评论(0) 推荐(0)

摘要：一些巨佬的博客，无事闲逛，收获颇多 1、byvoid 2、skywalkert 3、阅读全文

posted @ 2019-02-18 19:47 Member 阅读(151) 评论(0) 推荐(0)

摘要：2018年 12月 #103[HolseLeet]可并堆之左偏树https://www.luogu.org/blog/cytus/ke-bing-dui-zhi-zuo-pian-shu #102[vercont]区块链，你知道多少？https://www.luogu.org/blog/cong66 阅读全文

posted @ 2018-12-23 10:29 Member 阅读(2275) 评论(0) 推荐(1)

初始化函数的简单写法

摘要：struct seg { double l, r, h; int flag; seg() {} seg(double a,double b,double c,int d) : l(a), r(b), h(c), flag(d) {} bool operator < (const seg &cmp) const { return h ... 阅读全文

posted @ 2018-12-15 18:58 Member 阅读(484) 评论(0) 推荐(0)

关于对拍

摘要：先生成随机数 ```cpp #include #include #include #include using namespace std; long long seed; int main() { freopen("merge.in","w",stdout); seed=time(0); sran 阅读全文

posted @ 2018-12-11 00:03 Member 阅读(165) 评论(0) 推荐(0)

老学长的TODOLIST

摘要：初期: 一、基本算法: (1)枚举(poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法 (4)递推 (5)构造法(poj3295)（这种东西真的只是靠智商） (6)模拟法(poj1068,poj2632,poj1573,poj2993, 阅读全文

posted @ 2018-12-11 00:00 Member 阅读(166) 评论(0) 推荐(0)

离散化

摘要：# 第一种离散化：重复元素离散值相同 ```cpp const int maxn=1e5+10; int a[maxn], t[maxn], b[maxn]; int n; scanf("%d",&n); for(int i=1; i<=n; i++) scanf("%d",a[i]),t[i]=a 阅读全文

posted @ 2018-12-10 23:56 Member 阅读(148) 评论(0) 推荐(0)

随笔分类 - 杂项

公告