题目链接：

QSC and Master

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 832 Accepted Submission(s): 314

Problem Description

Every school has some legends, Northeastern University is the same.

Enter from the north gate of Northeastern University，You are facing the main building of Northeastern University.Ninety-nine percent of the students have not been there，It is said that there is a monster in it.

QSCI am a curious NEU_ACMer，This is the story he told us.

It’s a certain period，QSCI am in a dark night, secretly sneaked into the East Building，hope to see the master.After a serious search，He finally saw the little master in a dark corner. The master said：

“You and I, we're interfacing.please solve my little puzzle！

There are N pairs of numbers，Each pair consists of a key and a value，Now you need to move out some of the pairs to get the score.You can move out two continuous pairs，if and only if their keys are non coprime(their gcd is not one).The final score you get is the sum of all pair’s value which be moved out. May I ask how many points you can get the most？

The answer you give is directly related to your final exam results~The young man~”

QSC is very sad when he told the story，He failed his linear algebra that year because he didn't work out the puzzle.

Could you solve this puzzle?

（Data range：1<=N<=300
1<=Ai.key<=1,000,000,000
0<Ai.value<=1,000,000,000）

Input

First line contains a integer T，means there are T(1≤T≤10) test case。

Each test case start with one integer N . Next line contains N integers，means Ai.key.Next line contains N integers，means Ai.value.

Output

For each test case,output the max score you could get in a line.

Sample Input

1 2 3

1 1 1

1 2 4

1 1 1

1 3 4 3

1 1 1 1

Sample Output

题意：

给n对数,如果相邻的一对数的第一个的gcd！=1,那么这两个数就可以一块拿走,获得第二个数的和的收益,求最大的收益;

思路：

dp[l][r]表示区间[l,r]的最大收益,转移的时候可以发现要么是分成两段dp[l][r]=max(dp[l][k],dp[k+1][r]);

要么是把中间的都取完,然后让a[l]和a[r]一块取,那么就要判断中间的[l+1,r-1]是否能取完,

用前缀和sum[r]-sum[l-1]==dp[l][r]就可以说区间都被取完了,因为这些数都是正数;

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>
#include <map>using namespace std;#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));typedef  long long LL;template<class T> void read(T&num) {char CH; bool F=false;for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {if(!p) { puts("0"); return; }while(p) stk[++ tp] = p%10, p/=10;while(tp) putchar(stk[tp--] + '0');putchar('\n');
}const LL mod=1e9+7;
const double PI=acos(-1.0);
const LL inf=1e18;
const int N=(1<<20)+10;
const int maxn=300+10;
const double eps=1e-12;LL a[maxn],b[maxn],sum[maxn],dp[maxn][maxn];
LL gcd(LL x,LL y)
{if(y==0)return x;return gcd(y,x%y);
}
int main()
{int t,n;read(t);while(t--){read(n);For(i,1,n)read(a[i]);For(i,1,n)read(b[i]),sum[i]=sum[i-1]+b[i];mst(dp,0);for(int r=1;r<=n;r++){for(int l=r-1;l>0;l--){for(int k=l;k<=r;k++)dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+1][r]);if(gcd(a[l],a[r])!=1&&dp[l+1][r-1]==sum[r-1]-sum[l])dp[l][r]=max(dp[l+1][r-1]+b[l]+b[r],dp[l][r]);}}print(dp[1][n]);}return 0;
}

转载于:https://www.cnblogs.com/zhangchengc919/p/5889619.html

hdu-5900 QSC and Master(区间dp)相关推荐

HDU 2476 String painter （区间DP）
题意:给出两个串a和b,一次只能将一个区间刷一次,问最少几次能让a=b 思路:首先考虑最坏的情况,就是先将一个空白字符串刷成b需要的次数,直接区间DP[i][j]表示i到j的最小次数. 再考虑把a变成 ...
hdu 4597 + uva 10891(一类区间dp)
题目链接:http://vjudge.net/problem/viewProblem.action?id=19461 思路:一类经典的博弈类区间dp,我们令dp[l][r]表示玩家A从区间[l, r] ...
hdu 5151 Sit sit sit(区间dp+排列组合)
题目链接:hdu 5151 Sit sit sit 题意: 一共有并排N个椅子, N个学生依次去坐,同时满足3个条件就不能坐下去: 1,该椅子不在最左,不在最右. 2,该椅子左右都有人坐了. 3,左右 ...
HDU 5115 Dire Wolf ——（区间DP）
比赛的时候以为很难,其实就是一个区间DP= =..思路见:点我. 区间DP一定要记住先枚举区间长度啊= =~!因为区间dp都是由短的区间更新长的区间的,所以先把短的区间更新完.. 代码如下: 1 #i ...
HDU 5151 Sit sit sit 区间DP + 排列组合
Sit sit sit 问题描述在一个XX大学中有NN张椅子排成一排,椅子上都没有人,每张椅子都有颜色,分别为蓝色或者红色. 接下来依次来了NN个学生,标号依次为1,2,3,...,N. 对于每个学 ...
hdu 5151 Sit sit sit(区间dp)
题意: 给出一排座位现在要让所有学生入座,每个座位都有颜色,0表示蓝色,1表示红色,但是如果同时满足以下条件学生就不会坐下这个位置: 1.座位的左右都有座位 2.座位的左右都有人坐下了 3.座位的左右 ...
【HDU - 5900】QSC and Master（区间dp）
题干: Every school has some legends, Northeastern University is the same. Enter from the north gate of ...
HDU5900 QSC and Master（区间DP + 最小费用最大流）
题目 Source http://acm.hdu.edu.cn/showproblem.php?pid=5900 Description Every school has some legends, ...
HDU 5115 Dire Wolf 区间dp
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5115 Dire Wolf Time Limit: 5000/5000 MS (Java/Others ...

hdu-5900 QSC and Master(区间dp)

QSC and Master

hdu-5900 QSC and Master(区间dp)相关推荐

最新文章

热门文章