题目:P4342 [IOI1998]Polygon
分析:
这道题就只有一点需要注意:不能只用一个dp[i][j](最大值)来转移,因为子状态可能为负,会影响转移,因此还要再开一个dpmin维护最小值。
(又被卡了一会,还是太菜了,啥时候随手切蓝题)
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空,不开long long见祖宗
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int maxn = 55;
const int inf = 0x3f3f3f3f;
char ope[maxn << 1];
int num[maxn << 1];
int dp[maxn << 1][maxn << 1], dp1[maxn << 1][maxn << 1]; // dp1 stands for minval
int n;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
string tmp; cin >> tmp; ope[i] = ope[i + n] = tmp[0];
cin >> num[i]; num[i + n] = num[i];
}
mem(dp, -inf), mem(dp1, inf);
for(int i = 1; i <= n * 2; i++)
dp[i][i] = dp1[i][i] = num[i];
for(int len = 2; len <= n; len++)
for(int i = 1; i + len - 1 <= 2 * n; i++)
{
int j = i + len - 1;
for(int k = i; k < j; k++)
{
if(ope[k + 1] == 't')
{
dp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j]);
dp1[i][j] = min(dp1[i][j], dp1[i][k] + dp1[k + 1][j]);
}
else
{
dp[i][j] = max({dp[i][j], dp[i][k] * dp[k + 1][j], dp[i][k] * dp1[k + 1][j],
dp1[i][k] * dp[k + 1][j], dp1[i][k] * dp1[k + 1][j]});
dp1[i][j] = min({dp1[i][j], dp[i][k] * dp[k + 1][j], dp[i][k] * dp1[k + 1][j],
dp1[i][k] * dp[k + 1][j], dp1[i][k] * dp1[k + 1][j]});
}
}
}
int maxx = -inf;
for(int i = 1; i + n - 1 <= 2 * n; i++)
maxx = max(maxx, dp[i][i + n - 1]);
set<int> res;
for(int i = 1; i + n - 1 <= 2 * n; i++)
if(dp[i][i + n - 1] == maxx && i <= n)
res.insert(i);
cout << maxx << endl;
vector<int> ans(res.begin(), res.end());
for(int i = 0; i < ans.size(); i++)
printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
}