Marvolo Gaunt's Ring（Codeforses855B）

Marvolo Gaunt’s Ring

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
inputCopy
5 1 2 3
1 2 3 4 5
outputCopy
30
inputCopy
5 1 2 -3
-1 -2 -3 -4 -5
outputCopy
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.

这道题需要维护前后缀，因为要保证i<=j<=k,所以在选择j时保证所选前后达到最大。
ac代码：

#include<iostream>
using namespace std;
const int inf=0x3f3f3f3f;
const long long INF=0x3f3f3f3f3f3f3f3f;
int n;
long long a[100005],p,q,k,Left[100005],Right[100005];
long long ans=0,minn=0x3f3f3f3f,maxn=-0x3f3f3f3f;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>p>>q>>k;
	for(int i=0;i<n;i++){
		cin>>a[i];
		
	}
	Left[0]=a[0]*p;
	Right[n-1]=a[n-1]*k;
	for(int i=1;i<n;i++){
		Left[i]=max(Left[i-1],p*a[i]);
	}
	for(int i=n-2;i>=0;i--){
		Right[i]=max(Right[i+1],k*a[i]);
	}
	long long ans=-0x3f3f3f3f3f3f3f3f;
	for(int i=0;i<n;i++){
		ans=max(ans,Left[i]+q*a[i]+Right[i]);
	}
	
	cout<<ans<<endl;
	return 0;
}