[HDOJ5900]QSC and Master（区间dp）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5900

巧妙的地方在于第四个转移，假如dp(i,j)区间内所有的都取了，那状态的值应该是s(j)-s(i-1)

#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define cl clear
#define BUG puts("here!!!")
#define W(a) while(a--)
#define pb(a) push_back(a)
#define Rint(a) scanf("%d", &a)
#define Rll(a) scanf("%I64d", &a)
#define Rs(a) scanf("%s", a)
#define Cin(a) cin >> a
#define FRead() freopen("in", "r", stdin)
#define FWrite() freopen("out", "w", stdout)
#define Rep(i, len) for(int i = 0; i < (len); i++)
#define For(i, a, len) for(int i = (a); i < (len); i++)
#define Cls(a) memset((a), 0, sizeof(a))
#define Clr(a, x) memset((a), (x), sizeof(a))
#define Full(a) memset((a), 0x7f7f7f, sizeof(a))
#define lrt rt << 1
#define rrt rt << 1 | 1
#define pi 3.14159265359
#define RT return
#define lowbit(x) x & (-x)
#define onecnt(x) __builtin_popcount(x)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<LL, LL> pll;
typedef map<string, int> msi;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;

const int maxn = 330;
int n;
pii a[maxn];
LL s[maxn];
LL dp[maxn][maxn];

signed main() {
  //FRead();
  int T;
  Rint(T);
  W(T) {
    Cls(s);
    Rint(n);
    For(i, 1, n+1) Rint(a[i].first);
    For(i, 1, n+1) {
      Rint(a[i].second);
      s[i] = s[i-1] + a[i].second;
    }
    Cls(dp);
    For(k, 2, n+1) {
      For(i, 1, n-k+2) {
        int j = i + k - 1;
        For(p, i, j) dp[i][j] = max(dp[i][j], dp[i][p]+dp[p+1][j]);
        if(__gcd(a[i].first, a[j].first) > 1) {
          if(k == 2) dp[i][j] = a[i].second + a[j].second;
          else {
            if(s[j-1] - s[i] == dp[i+1][j-1]) {
              dp[i][j] = max(dp[i][j], dp[i+1][j-1]+a[i].second+a[j].second);
            }
          }
          dp[i][j] = max(dp[i][j], max(dp[i][j-1], dp[i+1][j]));
        }
      }
    }
    printf("%I64d
", dp[1][n]);
  }
  RT 0;
}