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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B17498 {
static int N, M, D;
static long min = Long.MIN_VALUE, max = Long.MIN_VALUE;
static long[][] arr, dp;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
D = Integer.parseInt(st.nextToken());
arr = new long[N][M];
dp = new long[N][M];
for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < M; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
for (int i = 1; i < N; i++) {
Arrays.fill(dp[i], min);
}
for(int i=0;i<N;i++) {
for (int j = 0; j < M; j++) {
for (int x = i+1; x <= i+D; x++) {
for (int y = j-D; y <= j+D; y++) {
if(x<0||y<0||x>=N||y>=M) continue;
if(Math.abs(x-i) + Math.abs(y-j) <= D) {
dp[x][y] = Math.max(dp[x][y],dp[i][j] + arr[x][y]*arr[i][j]);
}
}
}
}
}
for (int i = 0; i < M; i++) {
max = Math.max(max, dp[N-1][i]);
}
System.out.println(max);
}
}
|