Submission #1071115

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <algorithm>

using namespace std;

#define	numberof(a)	(sizeof(a) / sizeof(a[0]))
#define	INF		(1000000)
#define Rep(i,n) for(int i = 0; i < (n); i++ )

using namespace std;

typedef long long ll;

int main()
{
	ll N = 0, A = 0, B = 0;
	vector<ll> X;
	ll ret = 0;

	cin >> N >> A >> B;
	X.resize(N);

	Rep(i, N) {
		cin >> X[i];
	}

	Rep(i, N - 1) {
		ll dist = X[i + 1] - X[i];
		ret += min(dist * A, B);
	}

	cout << ret << endl;

	return 0;
}

Submission Info

Judge Result