摘要:
"ref" 前置技能是bzoj的串珠子。这种子集dp好神啊qwq。 还有这种钦定点转移子集的方法建议按这题的方法写,不要看串珠子qwq cpp include include using namespace std; typedef long long ll; int n, m, w[15], uu 阅读全文
posted @ 2018-05-28 21:15
poorpool
阅读(160)
评论(0)
推荐(0)
摘要:
这是一道神子集dp…… "ref1" , "ref2" , "ref3" cpp include include using namespace std; int n, c[19][19], g[66005], f[66005]; typedef long long ll; const int mo 阅读全文
posted @ 2018-05-28 16:46
poorpool
阅读(129)
评论(0)
推荐(0)
摘要:
原来矩阵树定理对于边是概率的情况也是适用的qwqwq。 "ref" cpp include include include using namespace std; int n; double w[55][55], uu; const double eps=1e 7; void gauss(){ f 阅读全文
posted @ 2018-05-28 10:07
poorpool
阅读(196)
评论(0)
推荐(0)
摘要:
据说pkusc出了好几年半平面交了,我也来水一发 "ref" cpp include include include include using namespace std; int n, cnt, tot; const double eps=1e 7; struct Point{ double x 阅读全文
posted @ 2018-05-28 08:56
poorpool
阅读(112)
评论(0)
推荐(0)

浙公网安备 33010602011771号