![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
点、边双连通分量
文章平均质量分 92
MaxMercer
成都七中学生,OIer
展开
-
[BZOJ]1123 [POI2008]BLO 割点
1123: [POI2008]BLOTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 1301 Solved: 591[Submit][Status][Discuss]DescriptionByteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 所有t原创 2017-10-09 21:45:40 · 349 阅读 · 0 评论 -
[POJ]2942 圆桌骑士 点双连通分量 + 二分图染色
#include#include#include#includeusing namespace std;#define clear(a) memset(a,0,sizeof(a))#define maxn 1010bool mark[maxn],vis[maxn];int point,all,indexx,cnt,num,n,m,x,y,ans;int h[maxn],col[m原创 2017-07-13 09:04:55 · 502 阅读 · 0 评论 -
[POJ]3352 Road Construction 双连通分量缩点
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12499 Accepted: 6284DescriptionIt's almost summer time, and that means that it's al原创 2017-10-10 20:11:49 · 384 阅读 · 0 评论 -
强连通分量 & 割点/桥 & 点/边双连通分量 [模板]
#include<stdio.h>//强连通分量 void tarjan(int u){ low[u] = dfn[u] = ++ idx; s.push(u); for (int i = h[u]; i; i = e[i].nxt) { int v = e[i].v; if(!dfn[v]) tarjan(v), low[u]原创 2017-11-09 17:16:26 · 288 阅读 · 0 评论 -
[BZOJ]2427 软件安装 O(nm)树形背包
2427: [HAOI2010]软件安装Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 1913 Solved: 757[Submit][Status][Discuss]Description现在我们的手头有N个软件,对于一个软件i,它要占用Wi的磁盘空间,它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机原创 2018-01-15 17:58:27 · 729 阅读 · 0 评论