图形的填充

搜索可能是最笨的图形填充方法了，简单写了一遍。

DFS为了防止爆栈手动扩了一下栈应该够用了，或者改 BFS 弄，其实都一样。

使用了EasyX图形库，对 EasyX 团队表示感谢

#include <bits/stdc++.h>
#include <graphics.h>
#include <conio.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;

int dirx[] = { 1,-1,0,0 }, diry[] = { 0,0,-1,1 };
void boundyary_fill_by_dfs(int n, int m, int x, int y, int fcolor, int bcolor) {
	putpixel(x, y, fcolor);
	for (int i = 0; i < 4; i++) {
		int nowx = x + dirx[i], nowy = y + diry[i];
		if (nowx<0 || nowx>n || nowy<0 || nowy>m) continue;
		int color = getpixel(nowx, nowy);
		if (color == fcolor || color == bcolor) continue;
		boundyary_fill_by_dfs(n, m, nowx, nowy, fcolor, bcolor);
	}
}

int main() {
	initgraph(640, 640);
	circle(150, 150, 100);
	boundyary_fill_by_dfs(640, 640, 150, 150, RED, WHITE);
	system("pause");
}