题目描述 输入样例 4 6 1 2 10 2 3 20 3 4 30 4 1 40 1 3 50 2 4 60 输出样例 150 AC Code #include <iostream> #include <queue> #include <algorithm> #include <cstring> using namespace std; const int maxn = 55; int s[maxn][maxn] = { 0}; bool vis[maxn]; int n,m,ans = 0,tmp = 0; void dfs(int