图论
文章平均质量分 50
white Era
这个作者很懒,什么都没留下…
展开
-
Tarjan模板(找连通分量)
又学了个图算法,,花了几个小时,,才算懂了。。Tarjan算法讲解看–》https://blog.csdn.net/qq_34374664/article/details/77488976这个大佬讲的好!代码:#include <iostream>#include <string.h>#include <stdlib.h>#include <stdio.h>#include <vector>using namespace std;原创 2021-08-07 11:05:42 · 65 阅读 · 0 评论 -
最大团与最大独立模板+模板题
这里有几个概念要清楚:最大团: V中取K个顶点,两点间相互连接最大独立集: V中取K个顶点,两点间不连接最大团数量 = 补图中最大独立集数,最大独立集数=补图中最大团数量第一个回溯板子,,一般没啥用#include <iostream>#include <cstring>using namespace std;const int N = 1000;bool g[N][N];bool x[N];int cnt, bestn;int n, e;void b原创 2021-08-02 22:00:35 · 177 阅读 · 0 评论 -
并查集模板
题目:https://www.luogu.com.cn/problem/P1551具体的写在程序里面了,查找用了路径压缩,合并有直接合并法和按秩合并法AC代码:#include <iostream>using namespace std;const int N = 5050;int Rank[N];int a[N];void init(int n){ for(int i = 1;i<=n;i++){ a[i] = i; Rank[i] = 1; }}原创 2021-07-31 20:14:47 · 64 阅读 · 0 评论 -
单源最短路径模板(dijsktra+优先队列)
题目: https://www.luogu.com.cn/problem/P4779AC代码:#include <iostream>#include <queue>#include <cstring>using namespace std;const int inf = int(1e9);const int N = 100010, M = 200050;struct edge { int next, to, w;}edges[M];int原创 2021-07-30 21:41:34 · 218 阅读 · 0 评论 -
最小费用最大流模板(SPFA)
题目:https://www.luogu.com.cn/problem/P3381AC代码:#include <iostream>#include <queue>#include <cstring>using namespace std;typedef long long ll;const int N = 10010,M = 500050;const ll inf = ll(1e18);struct edge{ int next,to; ll原创 2021-07-30 21:18:48 · 103 阅读 · 0 评论 -
最大流最小割模板
题目:https://vjudge.net/problem/UVA-10480The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist militarysuper power has d原创 2021-07-30 09:14:13 · 66 阅读 · 0 评论 -
Smallest Minimum Cut
题目:https://acm.hdu.edu.cn/showproblem.php?pid=6214Problem DescriptionConsider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset of E原创 2021-07-29 10:31:41 · 85 阅读 · 0 评论 -
Swap(二分匹配+路径输出)
题目:https://acm.hdu.edu.cn/showproblem.php?pid=2819Problem DescriptionGiven an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1?InputThere are severa原创 2021-07-28 17:40:34 · 96 阅读 · 0 评论 -
最大流(dinic模板)
题目:https://www.luogu.com.cn/problem/P3376#include <iostream>#include <cstring>#include <queue>using namespace std;typedef long long ll;const int N = 10010,M = 50050;const ll inf = ll(1e18);struct edge{ ll next,to,w;}edges[M]原创 2021-07-28 16:31:30 · 78 阅读 · 0 评论 -
最大流模板(Edmond-Karp)
题目:https://www.luogu.com.cn/problem/P3376学习心得:FF算法,EK算法敲了五遍才真正理解,理解了才发现原来挺简单的。。估计刚开始被网络流这个名头吓住了,,下意识以为很难,,两个星期学完了30多个算法,有一半敲了十遍以上,另一遍估计就敲了五遍左右,,心急以为早点学完打比赛就不会慌了,,然而等到我回头用心看的时候才是真的理解了,,虽然学了好多个算法,但是都是短时间学的,不能灵活的运用,不能根据题目建模,如果用到这些模板算法的时候,建模是最难的一部分,,不会分离出模型,原创 2021-07-28 10:37:40 · 102 阅读 · 0 评论 -
最大流(Ford-Fulkerson模板)
/*题目 https://www.luogu.com.cn/record/52984766*/// 编写次数x5#include <iostream>#include <bitset>using namespace std;typedef long long ll;const ll N = 10010, E = 200010;struct node { ll next, to; ll w;}nodes[E];bitset<N> vis;原创 2021-07-27 21:40:26 · 92 阅读 · 0 评论 -
Treasure Exploration(最小相交路径覆盖)
题目:http://poj.org/problem?id=2594Language:DefaultTreasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 11689 Accepted: 4746DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about原创 2021-07-25 20:08:43 · 87 阅读 · 0 评论 -
Air Raid(最小不相交路径覆盖)
题目:https://acm.hdu.edu.cn/showproblem.php?pid=1151Problem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town’s原创 2021-07-25 19:41:47 · 178 阅读 · 0 评论 -
HDU - 2389 Rain on your Parade(Hopcroft Karp算法)
题目:https://acm.hdu.edu.cn/showproblem.php?pid=2389 Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 8368 Accepted Submission(s): 2587Pro原创 2021-07-24 17:50:32 · 118 阅读 · 0 评论 -
Fire Net(二分图匹配)
题目:https://acm.hdu.edu.cn/showproblem.php?pid=1045Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle that has原创 2021-07-22 17:53:34 · 77 阅读 · 0 评论 -
二分图判断(Catch)
题目:https://acm.hdu.edu.cn/showproblem.php?pid=3478就是一道二分图判断问题,结果卡了一下午,,用链式向前星写就是一直超时,改来改去还是有问题。。看到网上大佬写,代码都差不多。。无语了~~不过看到一个博客写的代码真是不错,,然后就借鉴了大佬的做法。。题目分析1.判断是否可以在单位时间移动到任意位置(这点在写程序的时候不要也可以。。有点奇怪)2.判断是不是二分图,如果是二分图的话那么就会分成两个集合,在单位时间内是不可能到达任意位置的)AC代码:#in原创 2021-07-21 19:59:16 · 78 阅读 · 0 评论