poj 1179 Polygon(DP)

题意：给出一个有n个节点的环，节点有整数值，边是乘号*或者加号+。一开始去除一条边，然后每次选一条边，合并该边所连节点，知道最后只剩一个节点。求所能得到的最大值。

思路：类似矩阵乘法的O(n3) dp, 注意1：因为是环形，所以要取mod，注意2：保存min值，因为乘法运算。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <set>
#include <climits>
#define SPEED_UP iostream::sync_with_stdio(false);
using namespace std;

#define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i))

typedef long long LL;
typedef pair<int, int> pi;

const int Maxn = 55;
int Max[Maxn][Maxn], Min[Maxn][Maxn];
char sym[Maxn];
int val[Maxn];
int N;

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
#endif
    SPEED_UP
    cin >> N;
    rep(i, 0, N-1) {
        cin >> sym[i] >> val[i];
    }
    //rep(i, 0, N-1) cout << sym[i] << ' ' << val[i] << endl;
    rep(i, 0, N-1) Min[i][i] = Max[i][i] = val[i];
    rep(k, 1, N-1)
        rep(i, 0, N-1) {
            int j = i+k;
            int mj = j%N;
            Max[i][mj] = -INT_MAX;
            Min[i][mj] = INT_MAX;
            //cout << "dp: " << i << ' ' << mj << ", ";
            rep(l, i+1, j) {
                int ml = (l-1)%N, mr = l%N;
                if (sym[mr] == 't') {
                    Max[i][mj] = max(Max[i][mj], Max[i][ml]+Max[mr][mj]);
                    Min[i][mj] = min(Min[i][mj], Min[i][ml]+Min[mr][mj]);
                }
                else {
                    int t1 = Max[i][ml]*Max[mr][mj],
                        t2 = Max[i][ml]*Min[mr][mj],
                        t3 = Min[i][ml]*Max[mr][mj],
                        t4 = Min[i][ml]*Min[mr][mj];
                    Max[i][mj] = max(Max[i][mj], t1);
                    Max[i][mj] = max(Max[i][mj], t2);
                    Max[i][mj] = max(Max[i][mj], t3);
                    Max[i][mj] = max(Max[i][mj], t4);

                    Min[i][mj] = min(Min[i][mj], t1);
                    Min[i][mj] = min(Min[i][mj], t2);
                    Min[i][mj] = min(Min[i][mj], t3);
                    Min[i][mj] = min(Min[i][mj], t4);
                }
                //cout << mr << ' ';
            }
            //cout << "max: " << Max[i][mj] << endl;
        }
    int last, _max = -INT_MAX;
    rep(i, 0, N-1) {
        int j = (i+N-1)%N;
        if (Max[i][j] > _max) {
            _max = Max[i][j];
        }
    }
    cout << _max << endl;
    vector<int> ans;
    rep(i, 0, N-1) {
        int j = (i+N-1)%N;
        if (Max[i][j] == _max) {
            ans.push_back(i+1);
        }
    }
    int sz = ans.size();rep(i, 0, sz-2) cout << ans[i] << ' ';cout << ans[sz-1] << endl;
    return 0;
}