图论
淡蓝色的狼
这个作者很懒,什么都没留下…
展开
-
poj 1144
Network Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14606 Accepted: 6647 DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable network. They are原创 2017-09-06 20:50:26 · 162 阅读 · 0 评论 -
km算法模板 hdu2255
这篇博客讲的很好http://www.cnblogs.com/wenruo/p/5264235.html#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=1100;const int inf=0x3f3f3f3f;int g[m原创 2017-10-17 10:44:03 · 343 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 ——tarjan算法+缩点
Network of Schools POJ - 1236 A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distrib原创 2017-11-03 19:11:32 · 294 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 求割点裸题
B - Network UVA - 315 A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same n原创 2017-11-03 19:39:47 · 268 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 求桥(有坑点)
I - Caocao’s Bridges Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea.原创 2017-11-03 20:27:22 · 253 阅读 · 0 评论 -
POJ - 1486 Sorting Slides 枚举+二分匹配图
题意:如图所示:A包含1 2 4三点,即他可以A和1 2 3 匹配 B可以和1 3 匹配,以此类推 问有多少字母只能和某一个数字匹配,才能使匹配数最大?思路: 先建图,二分图,枚举二分图的每一条边,如果去掉这条边之后,匹配数减少,就说明该字母只能和该数字匹配。。#include<iostream>#inc原创 2017-12-06 22:19:37 · 145 阅读 · 0 评论 -
tarjan的应用 tarjan+缩点 Popular Cows POJ - 2186
Every cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell...原创 2018-04-01 20:40:34 · 144 阅读 · 0 评论 -
无向图中三元环的个数
#include <bits/stdc++.h>#define LL long longusing namespace std;const int bas = 1e5+1;const int maxn = 1e5+5;vector<int> G[maxn];int n, m;//unordered_set<LL> _hash;set<L...转载 2018-04-15 22:46:14 · 1052 阅读 · 0 评论 -
lca 倍增模板 求u,v的最近公共祖先
#include<iostream>#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;const int maxn=10010;const int DEG=20;struct edge{ i...原创 2018-04-06 17:37:45 · 167 阅读 · 0 评论 -
lca+倍增+最大生成树
NOIP2013货车运输题目描述 DescriptionA 国有 n 座城市,编号从 1 到 n,城市之间有 m 条双向道路。每一条道路对车辆都有重量限制,简称限重。现在有 q 辆货车在运输货物,司机们想知道每辆车在不超过车辆限重的情况下,最多能运多重的货物。输入描述 Input Description第一行有两个用一个空格隔开的整数 n,m,表示 A 国有 n 座城市和 m 条道...原创 2018-04-06 21:23:42 · 305 阅读 · 0 评论 -
tarjan 离线 lca hdu2586
lca的离线操作:这篇博客写的很好 https://www.cnblogs.com/JVxie/p/4854719.html。。我实现的代码#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=80010;struct node{原创 2017-11-08 21:27:00 · 219 阅读 · 0 评论 -
hdu 1269 tarjan算法模板
#include<iostream>#include<stack>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=110000;struct node{ int v,next;}edge[maxn*3];int cnt=0,n,m,ans,top,原创 2017-10-13 21:54:46 · 325 阅读 · 0 评论 -
图论题目
[点这里](http://blog.csdn.net/f_zyj/article/details/52914032)转载 2017-10-10 11:17:24 · 355 阅读 · 0 评论 -
poj 2117
Electricity Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5701 Accepted: 1864 DescriptionBlackouts and Dark Nights (also known as ACM++) is a company that provides electricity.原创 2017-10-27 21:55:28 · 502 阅读 · 0 评论 -
poj2942
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 13670 Accepted: 4583 DescriptionBeing a knight is a very attractive career: searching for the Holy G原创 2017-10-28 22:10:45 · 270 阅读 · 0 评论 -
hdu4738
Caocao’s BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5560 Accepted Submission(s): 1745Problem Description Caocao was defeated by原创 2017-10-29 11:27:58 · 383 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 E - Redundant Paths POJ - 3177
In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The co原创 2017-11-07 09:16:34 · 254 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 F - Warm up HDU - 4612 缩点+树的直径
N planets are connected by M bidirectional channels that allow instant transportation. It’s always possible to travel between any two planets through these channels. If we can isolate some planets原创 2017-11-07 09:21:01 · 343 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 Strongly connected HDU - 4635
Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after you add these edges, this原创 2017-11-07 11:29:21 · 231 阅读 · 0 评论 -
[kuangbin带你飞]专题九 连通图 Critical Links UVA - 796
In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all network interconnection paths between A and B pass throu原创 2017-11-07 22:33:28 · 316 阅读 · 0 评论 -
poj 3177 Redundant Paths
DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten App原创 2017-10-30 21:57:32 · 163 阅读 · 0 评论 -
HDU 1116 Play on Words 欧拉图的判断
题意:n个单词形成序列,能够使每一个单词的第一个字母和上一个单词的最后一个字母相同判断是否是欧拉通路并查集+判断度数原创 2018-04-19 16:30:20 · 172 阅读 · 0 评论