算法题
qq_39200707
这个作者很懒,什么都没留下…
展开
-
AcWing:含负权回路的最短路径
/*bellman_ford算法求最短路径*//*适用含有负权回路*/#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <cstring>using namespace std;const int maxsize = 505;int n, m, k;int dist[maxsize];int backup[maxsi原创 2021-03-02 14:39:40 · 176 阅读 · 0 评论 -
AcWing:堆优化版dijkstra算法
/*堆优化版dijkstra算法*/#include <iostream>#include <algorithm>#include <queue>#include <cstring>#include <vector>using namespace std;const int maxsize = 150005;int n, m;/*在邻接表里:第一个int为结点编号,第二个为边值*/typedef pair<int, in原创 2021-03-01 15:24:45 · 242 阅读 · 0 评论 -
AcWing:dijkstra求最短路径未优化版
未优化版#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int maxsize = 505;const int inf = 0x3f;int graph[maxsize][maxsize]; //邻接矩阵存储图int dist[maxsize];原创 2021-02-28 16:52:29 · 112 阅读 · 0 评论 -
AcWing打卡题:八数码问题
八数码问题#include <iostream>#include <algorithm>#include <queue>#include <unordered_map>#include <string>using namespace std;const int maxsize = 10;int exchange_min(string start){ queue<string> q;原创 2021-02-24 15:56:18 · 121 阅读 · 0 评论 -
01背包问题
01背包问题/*未优化版01背包 */#include <iostream>#include <algorithm>using namespace std;int f[1001][10001]; //第i件物品,容量为j的最大价值int w[1001]; //第i件物品的价值int v[1001]; //第i件物品原创 2021-02-11 11:53:06 · 85 阅读 · 0 评论