Submission #1871833

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#  define DBG(fmt, ...) printf(fmt, __VA_ARGS__)
#else
#  define DBG(fmt, ...)
#endif

#define MOD 1000000007
#define INF 1000000000
#define MAX_N 100010

ll N, A, B;
ll X[MAX_N];

int main()
{
    cin >> N >> A >> B;
    ll ans = 0;
    REP(i, N) {
        cin >> X[i];
    }
    for(int i = 1; i < N; ++i) {
        ll pat_a = (X[i] - X[i-1]) * A;
        if(pat_a > B) { ans += B; }
        else { ans += pat_a; }
    }
    printf("%lld\n", ans);
    return 0;
}

Submission Info

Judge Result