動的計画法

	C	D	E	F	G	H	I	J	K	L	M	N
1		0	1	2	3	4	5	6	7	8
2
3	1	0	0	16	16	16	16	16	16	16
4	2	0	0	16	19
5	3	0	0	16		23
6	4	0	0	16			28
7
8	1	0	0	16	16	16	16	16	16	16
9	2	0	0	16	19
10	3	0	0	16	19	23
11	4	0	0	16	19		28
12
13	1	0	0	16	16	16	16	16	16	16
14	2	0	0	16	19	19					←	max(16, 0+19)
15	3	0	0	16	19	23
16	4	0	0	16	19	23	28				←	max(23, 0+19)
17
18	1	0	0	16	16	16	16	16	16	16
19	2	0	0	16	19	19	35				←	max(16, 16+19)
20	3	0	0	16	19	23	35				←	max(16, 16+19)
21	4	0	0	16	19	23	28
22
23	1	0	0	16	16	16	16	16	16	16
24	2	0	0	16	19	19	35	35			←	max(16, 16+19)
25	3	0	0	16	19	23	35	39			←	max(16, 16+23)
26	4	0	0	16	19	23	28	39			←	max(16, 16+23)
27
28	1	0	0	16	16	16	16	16	16	16
29	2	0	0	16	19	19	35	35	35		←	max(16, 16+35)
30	3	0	0	16	19	23	35	39	42		←	max(16, 16+23)
31	4	0	0	16	19	23	28	39	44		←	max(16, 16+23)
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