-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathFishing.cpp
103 lines (82 loc) · 2.13 KB
/
Fishing.cpp
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
const int MAX_V = 10010;
const int INF = INT_MAX / 5;
int T;
int N, M;
int P[MAXN][MAXN];
int dp1[MAXN][MAXN][MAXN];
int dp2[MAXN][MAXN][MAXN];
int max_path(int a, int b, int len) {
if (len == 0) {
return 0;
} else if (a >= N || b >= M) {
return -INF;
} else {
int& ans = dp1[a][b][len];
if (ans == -1) {
ans = P[a][b] + max_path(a + 1, b + 1, len - 1);
ans = max(ans, max_path(a + 1, b, len));
ans = max(ans, max_path(a, b + 1, len));
}
return ans;
}
}
int min_path(int a, int b, int len) {
if (len == 0) {
return 0;
} else if (a >= N || b >= M) {
return INF;
} else {
int& ans = dp2[a][b][len];
if (ans == -1) {
ans = INF;
ans = P[a][b] + min_path(a + 1, b + 1, len - 1);
ans = min(ans, min_path(a + 1, b, len));
ans = min(ans, min_path(a, b + 1, len));
}
return ans;
}
}
void gen() {
int t = 10;
cout << t << "\n";
for (int a = 0; a < t; a++) {
cout << 100 << " " << 100 << "\n";
for (int i = 0; i < 100; i++) {
for (int j= 0; j < 100; j++) {
cout << rand() % 1000 << " ";
}
cout << "\n";
}
}
}
int main() {
//gen();
//return 0;
cin >> T;
for (int t = 1; t <= T; t++) {
cin >> N >> M;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> P[i][j];
for (int k = 0; k < MAXN; k++) {
dp1[i][j][k] = dp2[i][j][k] = -1;
}
}
}
int ans = 0;
for (int m = 1; m <= N / 2; m++) {
int pa = max_path(0, 0, m);
int pb = min_path(0, 0, 2 * m);
//cout << m << " " << pa << " " << pb << "\n";
int profit = max(0, pa - pb);
if (profit > ans) {
ans = profit;
}
}
cout << ans << "\n";
}
return 0;
}