Algorithm/백트래킹1 [백준][1799번][백트레킹] 비숍 비숍 https://www.acmicpc.net/problem/1799123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384#include int map[11][11]; // 처음 받아오는 값int visit_a[30]; // 체크int visit_b[30];int Max = 0;int chessSize; void Black(int row, int cal, int cnt){ if (cnt > Max) Max = cnt; if (cal > chessSize){ row++; if .. 2016. 3. 30. 이전 1 다음 728x90
