• 문제 링크
https://www.acmicpc.net/problem/27588
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = read(), m = read();
int[][] mat = new int[n][m];
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) mat[i][j] = read();
int min = Integer.MAX_VALUE;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int cnt = 0;
for (int k = 0; k < n; k++)
for (int l = 0; l < m; l++) cnt += mat[k][l] * (Math.abs(i - k) + Math.abs(j - l));
min = Math.min(min, cnt);
}
}
bw.write(String.valueOf(min));
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 24197 Tabbtabbande - Greedy / Java (0) | 2025.08.24 |
---|---|
[백준] 9377 String LD - Brute Force / Java (0) | 2025.08.22 |
[백준] 6942 9966 - Brute Force / Java (0) | 2025.08.21 |
[백준] 5359 Music - Brute Force / Java (0) | 2025.08.20 |
[백준] 16847 Teenage Mutant - Brute Force / Java (0) | 2025.08.19 |
댓글