완전탐색

import java.io.*; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { static int N; static int ans = 0; static StringTokenizer st; public static void recur(int[] A, int depth, int n) { //종료조건 if(depth == N) { ans = Math.max(ans, calculate(A, n)); return; } //재귀호출 for(int i = depth; i < N; i++) { swap(A, i ,depth); recur(A, depth+1, n); swap(A, i, depth); } } p..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Stack; import java.util.StringTokenizer; public class Main { static int N; static int M; static int[][] map; static ArrayList chickenMap; static ArrayList houseMap; static Stack selectedChicken; static int minDist; public static void dfs(int start, int cnt) { ..