From f929e9d58063e853682432ba96a789a2e766dcbf Mon Sep 17 00:00:00 2001
From: Ren Baoshuo <i@baoshuo.ren>
Date: Fri, 12 Nov 2021 16:55:24 +0800
Subject: [PATCH] =?UTF-8?q?275.=20=E4=BC=A0=E7=BA=B8=E6=9D=A1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

https://www.acwing.com/problem/content/submission/code_detail/8784330/
---
 AcWing/275/275.cpp | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 AcWing/275/275.cpp

diff --git a/AcWing/275/275.cpp b/AcWing/275/275.cpp
new file mode 100644
index 00000000..caa079eb
--- /dev/null
+++ b/AcWing/275/275.cpp
@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, m, w[55][55], f[55][55][55][55];
+
+int main() {
+    cin >> m >> n;
+    for (int i = 1; i <= m; i++) {
+        for (int j = 1; j <= n; j++) {
+            cin >> w[i][j];
+        }
+    }
+    for (int i = 1; i <= m; i++) {
+        for (int j = 1; j <= n; j++) {
+            for (int k = i + 1; k <= m; k++) {
+                for (int l = 1; l < j; l++) {
+                    f[i][j][k][l] = max({f[i - 1][j][k - 1][l], f[i - 1][j][k][l - 1], f[i][j - 1][k - 1][l], f[i][j - 1][k][l - 1]}) + w[i][j] + w[k][l];
+                    if (i == j && k == l) f[i][j][k][l] -= w[i][j];
+                }
+            }
+        }
+    }
+    cout << f[m - 1][n][m][n - 1] << endl;
+    return 0;
+}