altoer的博客

#include <iostream>#include <cstring>#include <cstdio>using namespace std;int n, k;const int N = 10;char mp[N][N];int num;bool row[N];int sum;typedef struct { int x, y;}Position;void Init() { num = 0; memset(row, true, s

1、要记得遍历后让vis[x][y] = true;2、在对所有满足条件的点做DFS时，直接用两层循环 for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (check(i, j)) { DFS(i, j); ans++; }

1、初始化。2、开的边的数量，无向边要多开。

#include <cstdio>#include <algorithm>#include <cstring>#include <iostream>#define MAXN 30using namespace std;struct Node { int degree; /* 度数 */ int index; /* 序号 ...