From 9bbafdceb9727db8e7d8f499eb012771937b93ee Mon Sep 17 00:00:00 2001
From: Baoshuo <i@baoshuo.ren>
Date: Wed, 6 Apr 2022 17:23:34 +0800
Subject: [PATCH] =?UTF-8?q?283.=20=E5=A4=9A=E8=BE=B9=E5=BD=A2?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

https://www.acwing.com/problem/content/submission/code_detail/13075079/
---
 AcWing/283/283.cpp    | 67 +++++++++++++++++++++++++++++++++++++++++++
 AcWing/283/data/5.ans |  3 ++
 AcWing/283/data/5.in  |  3 ++
 3 files changed, 73 insertions(+)
 create mode 100644 AcWing/283/283.cpp
 create mode 100644 AcWing/283/data/5.ans
 create mode 100644 AcWing/283/data/5.in

diff --git a/AcWing/283/283.cpp b/AcWing/283/283.cpp
new file mode 100644
index 00000000..902f0f7e
--- /dev/null
+++ b/AcWing/283/283.cpp
@@ -0,0 +1,67 @@
+#include <algorithm>
+#include <iostream>
+#include <limits>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+const int N = 55 << 1;
+
+int n, w[N], f[N][N], g[N][N], ans;
+char op[N];
+
+int main() {
+    std::ios::sync_with_stdio(false);
+
+    cin >> n;
+    for (int i = 1; i <= n; i++) {
+        cin >> op[i] >> w[i];
+        w[n + i] = w[i];
+        op[n + i] = op[i];
+    }
+
+    for (int i = 1; i <= (n << 1); i++) {
+        f[i][i] = g[i][i] = w[i];
+    }
+    for (int len = 2; len <= n; len++) {
+        for (int l = 1, r = len; r <= n * 2; l++, r++) {
+            f[l][r] = std::numeric_limits<int>::min();
+            g[l][r] = std::numeric_limits<int>::max();
+
+            for (int k = l; k < r; k++) {
+                int maxl = f[l][k], maxr = f[k + 1][r];
+                int minl = g[l][k], minr = g[k + 1][r];
+
+                if (op[k + 1] == 't') {
+                    f[l][r] = std::max(f[l][r], maxl + maxr);
+                    g[l][r] = std::min(g[l][r], minl + minr);
+                } else {
+                    int x1 = minl * minr,
+                        x2 = minl * maxr,
+                        x3 = maxl * minr,
+                        x4 = maxl * maxr;
+                    f[l][r] = std::max({f[l][r], x1, x2, x3, x4});
+                    g[l][r] = std::min({g[l][r], x1, x2, x3, x4});
+                }
+            }
+        }
+    }
+
+    ans = std::numeric_limits<int>::min();
+    for (int i = 1; i <= n; i++) {
+        ans = std::max(ans, f[i][n + i - 1]);
+    }
+
+    cout << ans << endl;
+
+    for (int i = 1; i <= n; i++) {
+        if (ans == f[i][i + n - 1]) {
+            cout << i << ' ';
+        }
+    }
+
+    cout << endl;
+
+    return 0;
+}
diff --git a/AcWing/283/data/5.ans b/AcWing/283/data/5.ans
new file mode 100644
index 00000000..9289f7de
--- /dev/null
+++ b/AcWing/283/data/5.ans
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ac461cd93efe19adf6fb32cef1ca895a31660234a37bc75e47443101b7d7c94f
+size 9
diff --git a/AcWing/283/data/5.in b/AcWing/283/data/5.in
new file mode 100644
index 00000000..8cfaaca4
--- /dev/null
+++ b/AcWing/283/data/5.in
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f454c03e9dcfb49aae0744a2513468fea0b2f5a757361513f0353ccaff5cf301
+size 207