文化之旅 思路: 暴搜,倒搜: 代码: #include <bits/stdc++.h> using namespace std; #define maxn 105 #define maxm 200005 #define INF 0x7fffffff int n,k,m,s,t,E[maxm],V[maxm],head[maxn]; int cnt,W[maxm],num[maxn],ci[maxn],ans=INF; bool map_[maxn][maxn],if_[maxn]; inli…