좌표압축1

• 

  [백준][Java] 11997 - Load Balancing (Silver) 1. 문제 정보 https://www.acmicpc.net/problem/11997 11997번: Load Balancing (Silver) Farmer John's \(N\) cows are each standing at distinct locations \((x_1, y_1) \ldots (x_N, y_N)\) on his two-dimensional farm (\(1 \leq N \leq 1000\), and the \(x_i\)'s and \(y_i\)'s are positive odd integers of size at most \(1,000,000\)). FJ wants to par www.acmicpc.net 난이도 : G3 유형 : 좌표압축, 누적합 시간 : O(N^2) 2. 문제 풀이 x.. Algorithm, Problem Solving/백준(boj) 2024. 4. 16.