[DFS] 백준 2583

#include #include #include using namespace std; //2583 int dy[4] = {1, -1, 0, 0}; int dx[4] = {0, 0, 1, -1}; int m,n,k; int arr[100][100]; bool visited[100][100]={false,}; int cnt; void DFS(int y, int x); int main() { vector result; cin>>m>>n>>k; for (int i=0; i>x1 >> y1 >> x2 >> y2; for (int y = y1; y