2016 ACM/ICPC Asia Regional Shenyang Online 1009/HDU 5900 区间dp
QSC and Master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 859 Accepted Submission(s): 325
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)
Each test case start with one integer N . Next line contains N integers,means Ai.key.Next line contains N integers,means Ai.value.
pair<int , int>
,每次可以选相邻两个pair
。如果他们的first
不互质就可以把它们都删掉,并且获得second
之和的分数,问最大得分/******************************
code by drizzle
blog: www.cnblogs.com/hsd-/
^ ^ ^ ^
O O
******************************/
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#define ll long long
#define mod 1000000007
#define PI acos(-1.0)
using namespace std;
int t;
int n;
ll key[];
ll value[];
ll dp[][];
ll sum[];
ll gcd(ll a,ll b)
{
if(b==)
return a;
else
return gcd(b,a%b);
}
int main()
{
while(scanf("%d",&t)!=EOF)
{
for(int i=; i<=t; i++)
{
memset(dp,,sizeof(dp));
scanf("%d",&n);
for(int j=; j<=n; j++)
scanf("%d",&key[j]);
sum[]=;
for(int j=; j<=n; j++)
{
scanf("%d",&value[j]);
sum[j]=sum[j-]+value[j];
}
for(int j=n; j>=; j--)
{
for(int d=j+; d<=n; d++)
{
for(int zhong=j; zhong<d; zhong++)
dp[j][d]=max(dp[j][d],dp[j][zhong]+dp[zhong+][d]);
if(gcd(key[j],key[d])>)
{
if(d==j+)
dp[j][d]=value[j]+value[d];
else
{
if(dp[j+][d-]==sum[d-]-sum[j])
dp[j][d]=max(dp[j][d],dp[j+][d-]+value[j]+value[d]);
}
}
}
}
printf("%I64d\n",dp[][n]);
}
}
return ;
}
最新文章
- [LeetCode] Rearrange String k Distance Apart 按距离为k隔离重排字符串
- 最长上升子序列(LIS)模板
- git向gitHub上push和pull数据.
- nginx 多站点配置方法集合(转)
- 九度OJ 1480 最大上升子序列和 -- 动态规划
- nginx日志配置
- 百度背景画面切换效果,js做
- 哈希表原理及hashmap简单实现
- Docker Compose安装以及入门
- HoloLens开发手记 - 使用配件 Working with accessories
- 为Kubernetes集群部署本地镜像仓库
- vue生命周期理解图
- [Python_5] Python 线程
- Digital Color Meter 颜色值提取工具
- python笔记--冒泡排序升级版
- RAC DBCA 找不到共享磁盘
- javascript在字符串中提取网址并替换成超链接
- EF – 4.CRUD与事务
- java基础讲解14-----IO
- Excel数据常用操作,vlookup,text,trim,数据格式导致出错