Submission #1232567

---

Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {

	int N;
	long A,B;
	int[] X;

	public void solve() {
		N = nextInt();
		A = nextInt();
		B = nextInt();

		X = new int[N];
		for(int i = 0;i < N;i++){
			X[i] = nextInt();
		}

		long[] memo = new long[N];
		Arrays.fill(memo,Long.MAX_VALUE);
		memo[0] = 0;

		for(int i = 1;i < N;i++){

			if((X[i]-X[i-1])*A < B){
				memo[i] = Math.min(memo[i], (X[i]-X[i-1])*A+memo[i-1]);
			}else{
				memo[i] = Math.min(memo[i], B+memo[i-1]);
			}
		}
		out.println(memo[N-1]);
	}

	public static void main(String[] args) {
		out.flush();
		new Main().solve();
		out.close();
	}

	/* Input */
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[2048];
	private int p = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (p < buflen)
			return true;
		p = 0;
		try {
			buflen = in.read(buffer);
		} catch (IOException e) {
			e.printStackTrace();
		}
		if (buflen <= 0)
			return false;
		return true;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrint(buffer[p])) {
			p++;
		}
		return hasNextByte();
	}

	private boolean isPrint(int ch) {
		if (ch >= '!' && ch <= '~')
			return true;
		return false;
	}

	private int nextByte() {
		if (!hasNextByte())
			return -1;
		return buffer[p++];
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = -1;
		while (isPrint((b = nextByte()))) {
			sb.appendCodePoint(b);
		}
		return sb.toString();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}

Submission Info

Judge Result