AtCoder Regular Contest 067,D - Walk and Teleport(简单贪心，该类题目注意对给出数据排序)

题目描述：

                                  D - Walk and Teleport

Time Limit: 2 sec / Memory Limit: 256 MB

Score : 500500 points

Problem Statement

There are NN towns on a line running east-west. The towns are numbered 11 through N,

in order from west to east. Each point on the line has a one-dimensional coordinate, and a

point that is farther east has a greater coordinate value. The coordinate of town ii is XiXi.

You are now at town 11, and you want to visit all the other towns. You have two ways to travel:

• Walk on the line. Your fatigue level increases by AA each time you travel a distance of 1,

• regardless of direction.

• Teleport to any location of your choice. Your fatigue level increases by B, regardless of

• the distance covered.

Find the minimum possible total increase of your fatigue level when you visit all the towns in

these two ways.

Constraints

• All input values are integers.
• 2≤N≤105
• 1≤Xi≤109
• For all i(1≤i≤N−1)i(1≤i≤N−1), Xi<Xi+1
• 1≤A≤109
• 1≤B≤109

Input

The input is given from Standard Input in the following format:

N A B
X1 X2 ...... XN

Output

Print the minimum possible total increase of your fatigue level when you visit all the towns.

Sample Input 1 

4 2 5
1 2 5 7

Sample Output 1

11

From town 11, walk a distance of 11 to town 22, then teleport to town 33, then walk a distance

of 22 to town 44. The total increase of your fatigue level in this case is 2×1+5+2×2=11，

which is the minimum possible value.

Sample Input 2 Copy

Copy

7 1 100
40 43 45 105 108 115 124

Sample Output 2 Copy

Copy

84

From town 11, walk all the way to town 77. The total increase of your fatigue level in this case

is 8484, which is the minimum possible value.

Sample Input 3 Copy

Copy

7 1 2
24 35 40 68 72 99 103

Sample Output 3 Copy

Copy

12

Visit all the towns in any order by teleporting six times. The total increase of your fatigue level in

this case is 1212, which is the minimum possible value.

题意：

           X轴上N个小镇1~N，每个小镇一个坐标，某人从1号镇出发，遍历所有的小镇，

每次后移有2种方案：

                 方案1：每次走一单位花费A代价；

                 方案2：跳跃到任意一个小镇，花费B代价。

求遍历完所有小镇所花费的最小代价。

思路：

       这题思路简单，贪心即可，每次选择代价较小的一种方案。只是联想到这种“X轴”类型的题目

有时候需要的是从小到大的坐标，但题目给出的坐标并不一定是从小到大的（当然该题给出数据是排好序的），

所以注意排序。

代码实现：

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
LL a[N];
int main()
{
	LL n,A,B;
	while(cin>>n>>A>>B)
	{
		for(int i=1;i<=n;i++)cin>>a[i];
		sort(a+1,a+1+n);
		LL ans=0;
		for(int i=1;i<n;i++)
		{
			LL tmp=(a[i+1]-a[i])*A;
			ans+=min(tmp,B);
		}
		cout<<ans<<endl;
	}
	return 0;
}

The end；