博客
关于我
CodeForces - 855B Marvolo Gaunt's Ring(dp)
阅读量:289 次
发布时间:2019-03-01

本文共 2254 字,大约阅读时间需要 7 分钟。

Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly x drops of the potion he made.

Value of x is calculated as maximum of p·ai + q·aj + r·ak for given p, q, r and array a1, a2, ... an such that 1 ≤ i ≤ j ≤ k ≤ n. Help Snape find the value of x. Do note that the value of x may be negative.

Input

First line of input contains 4 integers n, p, q, r ( - 109 ≤ p, q, r ≤ 109, 1 ≤ n ≤ 105).

Next line of input contains n space separated integers a1, a2, ... an ( - 109 ≤ ai ≤ 109).

Output

Output a single integer the maximum value of p·ai + q·aj + r·ak that can be obtained provided 1 ≤ i ≤ j ≤ k ≤ n.

Examples

Input

5 1 2 31 2 3 4 5

Output

30

Input

5 1 2 -3-1 -2 -3 -4 -5

Output

12

Note

In the first sample case, we can take i = j = k = 5, thus making the answer as 1·5 + 2·5 + 3·5 = 30.

In second sample case, selecting i = j = 1 and k = 5 gives the answer 12.

求max(p*a[i]+q*a[j]+r*a[k]),满足i<=j<=k

首先可以用dp做  dp[j][i]表示前i个数中已经取了j个数的最大值.把p q r存到x[]数组里。

dp[j][i]=max(dp[j-1][i],dp[j][i-1]+x[i]*a[j])    

#include
///vj Busing namespace std;const int N=1e5+5;long long dp[N][4],a[N],x[4];int main(){ long long n,m; while(scanf("%lld%lld%lld%lld",&n,&x[1],&x[2],&x[3])!=EOF) { long long inf=-8e18; for(int i=1;i<=n;i++) scanf("%lld",&a[i]); for(int i=0;i<=n;i++) { for(int j=0;j<=3;j++) dp[i][j]=inf; } dp[1][1]=a[1]*x[1]; for(int i=1;i<=3;i++) { for(int j=1;j<=n;j++) { if(i==1) dp[j][i]=max(dp[j-1][i],a[j]*x[1]); else dp[j][i]=max(dp[j-1][i],dp[j][i-1]+a[j]*x[i]); } } cout<
<<'\n'; } return 0;}

还有一种比较简单的办法  orz

#include
using namespace std;const long long N=-8e18;int main(){ long long n,m,p,q,r; while(scanf("%lld%lld%lld%lld",&n,&p,&q,&r)!=EOF) { long long a=N,b=N,c=N; for(int i=0;i

 

转载地址:http://isio.baihongyu.com/

你可能感兴趣的文章
mysql中like % %模糊查询
查看>>
MySql中mvcc学习记录
查看>>
mysql中null和空字符串的区别与问题!
查看>>
MySQL中ON DUPLICATE KEY UPDATE的介绍与使用、批量更新、存在即更新不存在则插入
查看>>
MYSQL中TINYINT的取值范围
查看>>
MySQL中UPDATE语句的神奇技巧,让你操作数据库如虎添翼!
查看>>
Mysql中varchar类型数字排序不对踩坑记录
查看>>
MySQL中一条SQL语句到底是如何执行的呢?
查看>>
MySQL中你必须知道的10件事,1.5万字!
查看>>
MySQL中使用IN()查询到底走不走索引?
查看>>
Mysql中使用存储过程插入decimal和时间数据递增的模拟数据
查看>>
MySql中关于geometry类型的数据_空的时候如何插入处理_需用null_空字符串插入会报错_Cannot get geometry object from dat---MySql工作笔记003
查看>>
mysql中出现Incorrect DECIMAL value: '0' for column '' at row -1错误解决方案
查看>>
mysql中出现Unit mysql.service could not be found 的解决方法
查看>>
mysql中出现update-alternatives: 错误: 候选项路径 /etc/mysql/mysql.cnf 不存在 dpkg: 处理软件包 mysql-server-8.0的解决方法(全)
查看>>
Mysql中各类锁的机制图文详细解析(全)
查看>>