![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
斯坦纳树
文章平均质量分 77
neither_nor
这个作者很懒,什么都没留下…
展开
-
BZOJ4006 [JLOI2015]管道连接
f[i]表示令i这个颜色集合里的所有颜色都满足同颜色联通的最小代价则f[i]=min(g[i],f[i^j]+f[j])g[i]为对这些点做斯坦纳树,j为i的子集#include#include#include#include#include#include#include#include#include#include#include#include#includ原创 2017-03-17 16:52:13 · 822 阅读 · 0 评论 -
BZOJ4774 修路
同BZOJ4006#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXN 10010#define MAXM 10010#def原创 2017-03-17 16:53:08 · 1111 阅读 · 0 评论