[题目链接] https://www.lydsy.com/JudgeOnline/problem.php?id=1698 [算法] 最短路 [代码] #include<bits/stdc++.h> using namespace std; #define MAXN 35 ] = {,-,,-,,-,,-}; ] = {,,-,-,,,-,-}; struct edge { int to,nxt; } e[MAXN * MAXN * MAXN * MAXN]; int n,m,sx,sy,tx,…