释然的成长之路

多源BFS矩阵距离（多源BFS）#include <cstring>#include <iostream>#include <algorithm>#define x first#define y secondusing namespace std;typedef pair<int, int> PII;const int N = 1010, M = N * N;int n, m;char g[N][N];PII q[M];in

Flood Fill池塘问题DFS写法#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 1010;char g[N][N];int n, m;void dfs(int x, int y){ g[x][y] = '.'; int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0}