2018 焦作网络赛 Mathematical Curse dp

题目链接：https://nanti.jisuanke.com/t/A2012

题意：求把运算符都用完后，最大的结果

题解：当前a[i] > 0，那么直接通过前面最大的结果更新即可，对于a[i] <0，当运算符为+ - 时也是通过前面大的直接更新，但是 *  - 会改变结果的正负，所以要通过前面最小的结果来更新，所以维护两个最大最小dp即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
ll k;
// big            small
ll dp1[1010][6], dp2[1010][6];
ll a[1010];
char b[6];
ll cul(ll x, ll y, char op) {
    if(op == '+') return x + y;
    if(op == '-') return x - y;
    if(op == '*') return x * y;
    return x / y;
}
int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d %d %lld", &n, &m, &k);
        for(int i = 1; i <= n; i++)
            scanf("%lld", &a[i]);
        scanf("%s", b + 1);
        for(int i = 0; i <= n; i++)
            for(int j = 0; j <= m; j++)
                dp1[i][j] = -1e18, dp2[i][j] = 1e18;
        for(int i = 0; i <= n; i++)
            dp1[i][0] = dp2[i][0] = k;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= min(i, m); j++) {
                if(a[i] > 0) {
                    dp1[i][j] = max(dp1[i][j], max(dp1[i - 1][j], cul(dp1[i - 1][j - 1], a[i], b[j])));
                    dp2[i][j] = min(dp2[i][j], min(dp2[i - 1][j], cul(dp2[i - 1][j - 1], a[i], b[j])));
                } else if(b[j] == '+' || b[j] == '-') {
                    dp1[i][j] = max(dp1[i][j], max(dp1[i - 1][j], cul(dp1[i - 1][j - 1], a[i], b[j])));
                    dp2[i][j] = min(dp2[i][j], min(dp2[i - 1][j], cul(dp2[i - 1][j - 1], a[i], b[j]))); 
                } else {        
                    dp1[i][j] = max(dp1[i][j], max(dp1[i - 1][j], cul(dp2[i - 1][j - 1], a[i], b[j])));
                    dp2[i][j] = min(dp2[i][j], min(dp2[i - 1][j], cul(dp1[i - 1][j - 1], a[i], b[j])));
                }
        //      cout << i << " " << j << " " << dp1[i][j] << endl;
            }
        printf("%lld\n", dp1[n][m]);
    }
    return 0;
}