Submission #1072767

---

Source Code Expand

/*
ID: Motyaspr
LANG: C++11
TASK: dualpa
*/

#define _CRT_SECURE_NO_WARNINGS

// comment(linker, "/STACK:256000000")
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <ctime>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <deque>
#include <cassert>
#include <cstdlib>
#include <bitset>
#include <algorithm>
#include <string>
#include <list>
#include <fstream>
#include <cstring>
#include <climits>
#include <stack>
#include <random>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define forn(i, n) for(int i = 0; i < n; i++)
#define pk push_back
#define mk make_pair
#define all(v) v.begin(), v.end()
#define X first
#define Y second
#define TASK "ufo"

const double EPS = 1e-9;
const double pi = acos(-1.0);

const int MAXN = (int)1e5 + 150;
const ll INF = (ll)1e9 + 7;
const ll LINF = (ll)1e18 + 7;
const ll MOD = (ll)1e9 + 7;;
const ll P = 31;
const ll SZ = 50000 + 228;
const int K = 10;

ll n, x[MAXN], a, b;

int main()
{
#ifdef _DEBUG
	freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#else
	//freopen(TASK".in", "r", stdin), freopen(TASK".out", "w", stdout);
#endif
	srand(time(0) + 'P'	);	
	ll ans = 0;
	cin >> n; 
	cin >> a >> b;
	for (int i = 0; i < n; i++)
		cin >> x[i];
	for (int i = 1; i < n; i++)
		ans += min((x[i] - x[i - 1]) * a, b);
	cout << ans;
	return 0;
}

Submission Info

Judge Result