2021-05-06
#include <cstring>#include <iostream>#include <algorithm>#include <vector>using namespace std;const int N = 210, INF = 0x3f3f3f3f;int n, m;bool g[N][N]; //g[i][j]代表第i号村庄与第j号村庄相邻 bool vis[N];//当次状态 struct node{ int ans;
复制链接