Codeforces Round #375 (Div. 2) A. The New Year: Meeting Friends 水题

A. The New Year: Meeting Friends

题目连接：

http://codeforces.com/contest/723/problem/A

Description

There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x1, the second friend lives at the point x2, and the third friend lives at the point x3. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?

It's guaranteed that the optimal answer is always integer.

Input

The first line of the input contains three distinct integers x1, x2 and x3 (1 ≤ x1, x2, x3 ≤ 100) — the coordinates of the houses of the first, the second and the third friends respectively.

Output

Print one integer — the minimum total distance the friends need to travel in order to meet together.

Sample Input

7 1 4

Sample Output

6

Hint

题意

给你三个点，你需要找到另外一个点，使得那三个点到达那个点的距离和最小。

题解：

数据范围很小，直接暴力枚举就好了。

虽然答案显然就是中间那个点的位置。

代码

#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long x1,x2,x3;
	long long ans = 1e9;
	cin>>x1>>x2>>x3;
	for(int i=-10000;i<=10000;i++)
	{
		ans = min(ans,abs(x1-i)+abs(x2-i)+abs(x3-i));
	}
	cout<<ans<<endl;
}