:: ADVANCE ::

BAEKJOON ONLINE JUDGE 1992 쿼드트리 https://www.acmicpc.net/problem/1992 15분 123456789101112131415161718192021222324252627282930313233343536373839404142434445#include int n;int map[65][65]; void solve(int y, int x, int length){ int i, j, k; int flag = map[y][x]; int dy[4] = { 0, 0, 1, 1 }; int dx[4] = { 0, 1, 0, 1 }; for (i = 0; i

dovelet 20 단계 분할정복 balanced lineup / b_lineup http://59.23.113.171/30stair/b_lineup/b_lineup.php?pname=b_lineup 1차 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 #include using namespace std; int kee[50100]; int out[200100]; int main(void) { int n, q, i, s, e, max, min; scanf("%d %d", &n, &q); for(i = 1; i > kee[i]; } for(i = 1; i > s >> ..