qq_31457873的博客

解题思路：用bfs求出每个点到终点的最短距离，用dfs求出路径，这里注意dfs应该记忆化搜索。且数组必须是longlong型。#include<iostream> #include<cstdio> #include<queue> using namespace std; const int N=55; typedef long long LL; #define MM(a) memset(a,NULL

E - 加尔鲁什·地狱咆哮对阵虚灵大盗拉法姆                             Time Limit:1000MS    Memory Limit:131072KB    64bit IO Format:%lld & %llu                                                                   S