hdu5900 区间dp

题意：nn 个pair

#include<iostream>  
#include<cstdio>  
#include<cstdlib>  
#include<cstring>
#include<algorithm>
#include<vector>    
using namespace std; 
typedef long long ll;
pair<int,ll> q[305];
ll dp[305][305],sum[305];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&q[i].first);
        sum[0]=0;
        for(int i=1;i<=n;i++)
        {
           scanf("%lld",&q[i].second);
           sum[i]=sum[i-1]+q[i].second;
        }
        memset(dp,0,sizeof dp);  
        for(int len=2;len<=n;len++)
        {
            for(int l=1;l+len-1<=n;l++)
            {
                int r=l+len-1;
                if(sum[r-1]-sum[l]==dp[l+1][r-1]&&__gcd(q[r].first,q[l].first)>1)  
                {  
                    dp[l][r]=dp[l+1][r-1]+q[l].second+q[r].second;  
                    continue;  
                }  
                for(int k=l;k<r;k++)  
                    dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+1][r]);  
            }
        }
        printf("%lld\n",dp[1][n]);
    }
}