From 42d532b18261def83fdcd0afbe68ebf4f0495d2b Mon Sep 17 00:00:00 2001
From: Baoshuo <i@baoshuo.ren>
Date: Thu, 7 Apr 2022 09:22:58 +0800
Subject: [PATCH] =?UTF-8?q?P1063=20[NOIP2006=20=E6=8F=90=E9=AB=98=E7=BB=84?=
 =?UTF-8?q?]=20=E8=83=BD=E9=87=8F=E9=A1=B9=E9=93=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

R73362890
---
 Luogu/P1063/P1063.cpp | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 Luogu/P1063/P1063.cpp

diff --git a/Luogu/P1063/P1063.cpp b/Luogu/P1063/P1063.cpp
new file mode 100644
index 00000000..60b2e7da
--- /dev/null
+++ b/Luogu/P1063/P1063.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+const int N = 105 << 1;
+
+int n, a[N], f[N][N], ans;
+
+int main() {
+    std::ios::sync_with_stdio(false);
+
+    cin >> n;
+    for (int i = 1; i <= n; i++) {
+        cin >> a[i];
+        a[n + i] = a[i];
+    }
+
+    for (int len = 2; len <= n; len++) {
+        for (int l = 1, r = len; r <= n << 1; l++, r++) {
+            for (int k = l; k < r; k++) {
+                f[l][r] = std::max(f[l][r], f[l][k] + f[k + 1][r] + a[l] * a[k + 1] * a[r + 1]);
+            }
+        }
+    }
+
+    for (int i = 1; i <= n; i++) {
+        ans = std::max(ans, f[i][n + i - 1]);
+    }
+
+    cout << ans << endl;
+
+    return 0;
+}