Problem:
Score : 500 points

Problem Statement

There are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \leq i \leq R) and the j-th column (1 \leq j \leq C). The i-th item is at (r_i, c_i) and has the value v_i.

Takahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).

He can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.

Find the maximum possible sum of the values of items he picks up.

Constraints

1 \leq R, C \leq 3000

1 \leq K \leq \min(2 \times 10^5, R \times C)

1 \leq r_i \leq R

1 \leq c_i \leq C

(r_i, c_i) \neq (r_j, c_j) (i \neq j)

1 \leq v_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

R C K
r_1 c_1 v_1
r_2 c_2 v_2
:
r_K c_K v_K

Output

Print the maximum possible sum of the values of items Takahashi picks up.

Sample Input 1

2 2 3
1 1 3
2 1 4
1 2 5

Sample Output 1

8

He has two ways to get to the goal:

Visit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.

Visit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.

Thus, the maximum possible sum of the values of items he picks up is 8.

Sample Input 2

2 5 5
1 1 3
2 4 20
1 2 1
1 3 4
1 4 2

Sample Output 2

29

We have four items in the 1-st row. The optimal choices are as follows:

Visit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.

Sample Input 3

4 5 10
2 5 12
1 5 12
2 3 15
1 2 20
1 1 28
2 4 26
3 2 27
4 5 21
3 5 10
1 3 10

Sample Output 3

142

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include <stdio.h>
#define INF 1001001001001001001
typedef long long ll;
ll dp[3010][3010][4];
ll s[3010][3010];
ll min(ll x, ll y) {
	return x > y ? y : x;
}
ll max(ll x, ll y) {
	return x < y ? y : x;
}
int main() {
	int r, c, K;
	scanf("%d%d%d", &r, &c, &K);
	for (int i = 0; i <= r; i++) {
		for (int j = 0; j <= c; j++) {
			s[i][j] = -1;
			for (int k = 0; k < 4; k++) {
				dp[i][j][k] = -INF;
			}
		}
	}
	for (int i = 0; i < K; i++) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		a--;
		b--;
		s[a][b] = c;
	}
	dp[0][0][0] = 0;
	// i列j行k個
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			for (int k = 0; k < 4; k++) {
				if (dp[i][j][k] == -INF)
					continue;
				dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k]);
				dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k]);
				if (s[i][j] != -1 && k != 3) {
					dp[i][j + 1][k + 1] =
						max(dp[i][j + 1][k + 1], dp[i][j][k] + s[i][j]);
					dp[i + 1][j][0] =
						max(dp[i + 1][j][0], dp[i][j][k] + s[i][j]);
				}
			}
		}
	}
	// for (int i = 0; i <= r; i++) {
	// 	for (int j = 0; j <= c; j++) {
	// 		for (int k = 0; k < 4; k++) {
	// 			if (dp[i][j][k] < 0) {
	// 				printf("IN ");
	// 			} else {
	// 				printf("%02lld ", dp[i][j][k]);
	// 			}
	// 		}
	// 		printf("  ");
	// 	}
	// 	printf("\n");
	// }
	ll ans = -INF;
	for (int i = 0; i < 4; i++) {
		ans = max(ans, dp[r][c - 1][i]);
		ans = max(ans, dp[r - 1][c][i]);
	}
	printf("%lld\n", ans);
	return 0;
}