Submission #1514837

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdlib>
#include <queue>
#include <cstring>
#include <set>
#include <map>

using namespace std;

const int maxN = 1e5 + 10, modP = 1e9 + 7;

#define FORU(i, l, r) for (int i = l; i <= r; ++i)
#define FORD(i, r, l) for (int i = r; i >= l; --i)
#define REPU(i, r) for (int i = 0; i < r; ++i)
#define LL long long
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define PINT pair < ll, int >
#define BIT(x, i) ((x >> i) & 1)
#define NUM_SET_BIT __builtin_popcountll

int x[maxN], a, b, n;
LL res;

int main() {
    cin >> n >> a >> b;
    FORU(i, 1, n) cin >> x[i];
    FORU(i, 2, n)
        if (1ll * a * (x[i] - x[i - 1]) > b)
            res += b;
        else
            res += 1ll * a * (x[i] - x[i - 1]);
    cout << res;
}

Submission Info

Judge Result