Submission #1065970

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main()
{
	int n;
	ll k,m;
	cin>>n>>k>>m;
	vector<ll> dp1(n+2,1e18),dp2(n+2,1e18);
	dp1[0]=0;
	dp2[0]=0;
	vector<ll> v;
	ll a;
	cin>>a;
	v.push_back(a);
	for(int i=1;i<n;i++)
	{
		ll a;
		cin>>a;
		dp1[i]=min(dp1[i-1]+(a-v[i-1])*k,dp2[i-1]+(a-v[i-1])*k);
		dp2[i]=min(dp2[i-1]+m,dp1[i-1]+m);
		v.push_back(a);
	}
	cout<<min(dp1[n-1],dp2[n-1])<<endl;
	return 0;
}

Submission Info

Judge Result