m0_62593364的博客

题目：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 510, M = 100010;int n1, n2, m;int h[N], e[M], ne[M], idx;int match[N];bool st[N];void add(int a, int b){ e[idx] =.

题目：

题目：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 100010, M = 200010, INF = 0x3f3f3f3f;int n, m;int p[N];struct Edge{ int a, b, w; bool operator< (const Edge &a

题目：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 510, INF = 0x3f3f3f3f;int n, m;int g[N][N];int dist[N];bool st[N];int prim(){ memset(dist, 0x3f, sizeof dist); .

题目：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 210, INF = 1e9;int n, m, Q;int d[N][N];void floyd(){ for (int k = 1; k <= n; k ++ ) for (int i = 1; i <= .

题目：代码：#include <cstring>#include <iostream>#include <algorithm>#include <queue>using namespace std;const int N = 2010, M = 10010;int n, m;int h[N], w[M], e[M], ne[M], idx;int dist[N], cnt[N];bool st[N];void add.

题目：代码：#include <cstring>#include <iostream>#include <algorithm>#include <queue>using namespace std;const int N = 100010;int n, m;int h[N], w[N], e[N], ne[N], idx;int dist[N];bool st[N];void add(int a, int b, int

题目：代码：#include <cstring>#include <iostream>#include <algorithm>#include <queue>using namespace std;typedef pair<int, int> PII;const int N = 1e6 + 10;int n, m;int h[N], w[N], e[N], ne[N], idx;int dist[N];b.

稠密图：邻接矩阵存稀疏图：邻接表存。

题目：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 510, M = 10010;struct Edge{ int a, b, c;}edges[M];int n, m, k;int dist[N];int last[N];void bellman_ford(){ me

拓扑序列是针对有向图。拓扑序列例如：1-->2、2-->3、1-->3，则序列[1 2 3]是一个拓扑序列，因为满足起点在终点的前面。所以存在环的一定没有拓扑序列，而有向无环图一定存在拓扑序列，因此有向无环图又称为拓扑图。有向无环图的求法：入度指有多少条边指向自己，出度是有多少条边出去，因此3的入度为2，出度为0。...

题目：代码：#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <queue>using namespace std;const int N = 100010;int n, m;int h[N], e[N], ne[N], idx;int d[N],q[N];//插入边void add(in.

题目：样例：代码：#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 100010, M = N * 2;int n;int h[N], e[M], ne[M], idx;int ans = N; bool st[N]; //b...

题目：代码：#include <iostream>#include <algorithm>#include <unordered_map>#include <queue>using namespace std;int bfs(string state){ string end = "12345678x"; //定义终点：将3 X 3的数组展成一行，用字符串来表示其状态并存到队列中 queue<string.

BFS优点：求最短距离问题题目：移动距离：代码：#include <cstring>#include <iostream>#include <algorithm>using namespace std;typedef pair<int, int> PII;const int N = 110;int n, m;int g[N][N], d[N][N]; //g[][]存输入的数组，d[][]存每个点到起点的距离PI.

题目：代码：第一种搜素顺序#include <iostream>using namespace std;const int N = 10;int n;int path[N];char g[N][N];bool col[N],dg[N],udg[N]; //col[N]列，dg[N]正对角线，udg[N]反对角线void dfs(int u){ if(u==n){ //找到一组方案 for(int i=0;i<n;i++) p

DFS入门级（模板）_浮生未歇-优快云博客_dfs入门题目：代码：#include <iostream>using namespace std;const int N = 10;int n;int path[N];bool st[N];void dfs(int u){ if (u == n)//说明当前位置已填满 { for (int i = 0; i < n; i ++ )cout<<path[i]&l