Skip to content

Commit cb10b39

Browse files
authored
[20251016] BOJ / G5 / 사과나무 / 설진영
1 parent 8445f44 commit cb10b39

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
public static void main(String[] args) throws IOException {
7+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
9+
int N = Integer.parseInt(br.readLine());
10+
int[][] orchard = new int[N + 1][N + 1];
11+
12+
for (int i = 1; i <= N; i++) {
13+
StringTokenizer st = new StringTokenizer(br.readLine());
14+
for (int j = 1; j <= N; j++) {
15+
orchard[i][j] = Integer.parseInt(st.nextToken());
16+
}
17+
}
18+
19+
int[][] prefixSum = new int[N + 1][N + 1];
20+
for (int i = 1; i <= N; i++) {
21+
for (int j = 1; j <= N; j++) {
22+
prefixSum[i][j] = orchard[i][j] + prefixSum[i-1][j] + prefixSum[i][j-1] - prefixSum[i-1][j-1];
23+
}
24+
}
25+
26+
int maxProfit = Integer.MIN_VALUE;
27+
28+
for (int K = 1; K <= N; K++) {
29+
for (int i = K; i <= N; i++) {
30+
for (int j = K; j <= N; j++) {
31+
int sum = prefixSum[i][j] - prefixSum[i-K][j] - prefixSum[i][j-K] + prefixSum[i-K][j-K];
32+
maxProfit = Math.max(maxProfit, sum);
33+
}
34+
}
35+
}
36+
37+
System.out.println(maxProfit);
38+
}
39+
}
40+
```

0 commit comments

Comments
 (0)