DFS
BFS
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int N = 110;
typedef pair<int, int> PII;
int d[N][N];
int n, m;
int g[N][N];
int bfs(){
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
queue<PII> q;
q.push({0, 0});
d[0][0] = 0;
while (!q.empty())
{
auto t = q.front();
q.pop();
for (int i = 0; i < 4; i ++)
{
int x = t.first + dx[i], y = t.second + dy[i];
if (x >= 0 && x < n && y >= 0 && y < m
&& g[x][y] == 0 && d[x][y] == -1){
d[x][y] = d[t.first][t.second] + 1;
q.push({x, y});
}
}
}
return d[n - 1][m - 1];
}
int main()
{
memset(d, -1, sizeof d);
cin >> n >> m;
for (int i = 0; i < n; i ++ )
{
for (int j = 0; j < m; j ++ )
cin >> g[i][j];
}
int res = bfs();
cout << res;
return 0;
}
逃离大森林
bfs的“简单”应用
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 1010;
typedef pair<int, int> PII;
int n, m;
int d[N][N];
char g[N][N];
void bfs(PII start, PII end)
{
queue <PII> q;
int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
memset(d, 0x3f, sizeof d);
d[start.first][start.second] = 0;
q.push(start);
while (!q.empty())
{
PII t = q.front();
q.pop();
for (int i = 0; i < 4; i++)
{
int x = dx[i] + t.first, y = dy[i] + t.second;
if (x >= 0 && x < n && y >= 0 && y < m && g[x][y] != 'T' && d[x][y] > d[t.first][t.second] + 1)
{
d[x][y] = d[t.first][t.second] + 1;
q.push({ x, y });
}
}
}
}
int main(void)
{
PII start, end;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> g[i][j];
if (g[i][j] == 'S')
start = { i, j };
if (g[i][j] == 'E')
end = { i, j };
}
}
bfs(end, start);//这里倒过来,目的是查找某个点到终点的距离
int res = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (g[i][j] >= '0' && g[i][j] <= '9'
&& d[i][j] <= d[start.first][start.second]) {//挑战者到终点的距离小于本人,必定战斗
res += g[i][j] - '0';
}
}
}
// for (int i = 0; i < n; i++)
// {
// for (int j = 0; j < m; j++)
// {
// cout << g[i][j] << " ";
// }
// cout << endl;
// }
// for (int i = 0; i < n; i++)
// {
// for (int j = 0; j < m; j++)
// {
// if (d[i][j] == 1061109567) d[i][j] = 2;
// cout << d[i][j] << " ";
// }
// cout << endl;
// }
cout << res;
}
最短路:单源最短路:从1号点到n号点
①所有边权都是正数:朴素Dijkstra(O(n^2))、堆优化Dijkstra(O(mlogn))
②存在负权边
Bellman-Ford O(nm)
SPFA O(m) 最坏O(nm)
多源汇(起点、终点)最短路Floyd O(n^3)
m和n^2一个级别 稠密图
m和n一个级别 稀疏图
结构图如下:
难点:建图
朴素Dijkstra
集合s:已经确定了最短距离的点
① dis[1] = 0, dis[i] = +inf;
②for i : 0 ~ n
t ←不在s中的距离最近的点
s←t
用t更新其他点的距离
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510;
int n, m;
int g[N][N];
int dist[N];
bool st[N];//某个点的距离是否已经确定
//typedef pair<int, int> PII;
int dijkstra()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
for (int i = 0; i < n; i++)//进行n次迭代
{
int t = -1;//当前访问的点
for (int j = 1; j <= n; j++)//j从1号点开始,到n号点结束
if (!st[j] && (t == -1 || dist[t] > dist[j]))//寻找不在st中的最近的点
t = j;
st[t] = true;
for (int j = 1; j <= n; j++)
dist[j] = min(dist[j], dist[t] + g[t][j]);//用找到的这个点更新与其他点的距离
}
if (dist[n] == 0x3f3f3f3f)//四个3f是因为字节填充,int类型有4个字节
return -1;
else return dist[n];
}
int main()
{
cin >> n >> m;
memset(g, 0x3f, sizeof g);
while (m -- )
{
int a, b, c;
cin >> a >> b >> c;
g[a][b] = min(g[a][b], c);
}
int t = dijkstra();
cout << t << endl;
}
堆优化版Dijkstra
用优先队列写,每次从后面插进去,堆里有m个数
一个题解
Bellman-Ford算法
for i:1~n
for 所有边a, b, w a→b
dist[b] = min(dist[b], dist[a] + w);
循环n次后,对于所有的边都满足dist[b] ≤dist[a] + w
最短路题解
出现负权回路(循环一次后权值变小)时,不一定存在最短距离
SPFA算法:对bellman-ford算法的优化
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 100010;
int m, n, idx;
int e[N], w[N], ne[N], h[N];
int dist[N];
bool st[N];
typedef pair<int, int> PII;
void add(int a, int b, int c) // 添加一条边a->b,边权为c
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
int spfa()
{
queue<PII> q;
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
q.push({0, 1});
st[1] = true;
while (q.size())
{
PII p = q.front();
q.pop();
int t = p.second;
st[t] = false;
for (int i = h[t]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
if (!st[j])
{
q.push({dist[j], j});
st[j] = true;
}
}
}
}
if (dist[n] == 0x3f3f3f3f) return -1;
return dist[n];
}
int main()
{
memset(h, -1, sizeof h);
cin >> n >> m;
for (int i = 1; i <= m; i ++ )
{
int x, y, z;
cin >> x >> y >> z;
add(x, y, z);
}
spfa();
if (dist[n] == 0x3f3f3f3f) puts("impossible");
else cout << dist[n] << endl;
}
多源汇最短路
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
d(i, j) = min(d(i, j), d(i, k) + d(k, j));
d[k, i, j] 从i只经过1~k这些点到达j的最短距离
作者:小呆呆
链接:https://www.acwing.com/solution/content/6337/
f[i, j, k]表示从i走到j的路径上除i和j点外只经过1到k的点的所有路径的最短距离。那么f[i, j, k] = min(f[i, j, k - 1), f[i, k, k - 1] + f[k, j, k - 1]。
因此在计算第k层的f[i, j]的时候必须先将第k - 1层的所有状态计算出来,所以需要把k放在最外层。
读入邻接矩阵,将次通过动态规划装换成从i到j的最短距离矩阵
在下面代码中,判断从a到b是否是无穷大距离时,需要进行if(t > INF/2)判断,而并非是if(t == INF)判断,原因是INF是一个确定的值,并非真正的无穷大,会随着其他数值而受到影响,t大于某个与INF相同数量级的数即可
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 20010, INF = 1e9;
int n, m, k;
int d[N][N];
void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j ++)
{
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int main()
{
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i == j) d[i][j] = 0;
else d[i][j] = INF;
}
}
for (int i = 1; i <= m; i++)
{
int x, y, z;
cin >> x >> y >> z;
d[x][y] = min(d[x][y], z);
}
floyd();
for (int i = 1; i <= k; i++)
{
int a, b;
cin >> a >> b;
if (d[a][b] > INF / 2) puts("impossible");
else cout << d[a][b] << endl;
}
}
朴素prim
dist[i] ← inf
for (i = 0; i < n; i ++)
t←找到集合外距离最近的点
用t更新其他点到集合的距离
st[t] = true
最小生成树是所有最短距离组成的边
与Dijkstra算法的区别:
dist[j] = min(dist[j], dist[t] + g[t][j]);表示到1号点的最短距离
kruskal算法
①所有边按权重从小到大排序 O(mlogm)
②枚举每条边a——b,权重c O(m)
if a,b不连通
将这条边加入集合中
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 200010;
int n, m, u, v, w;
int p[N];//并查集
struct Edge{
int u, v, w;
bool operator < (Edge &W){
return w < W.w;
}
}edges[N];
int find(int x) // 并查集
{
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main()
{
cin >> n >> m;
for (int i = 0; i < m; i ++)
{
cin >> u >> v >> w;
edges[i] = {u, v, w};
}
sort(edges, edges + m);
for (int i = 1; i <= n; i ++)
p[i] = i;
int res = 0, cnt = 0;
for (int i = 0; i < m; i ++)
{
u = edges[i].u, v = edges[i].v, w = edges[i].w;
u = find(u), v = find(v);
if (u != v)
{
p[u] = v;//合并
res += w;
cnt ++;
}
}
if (cnt < n - 1) puts("impossible");
else cout << res << endl;
return 0;
}