Codeforces Round #375 (Div. 2) A. The New Year: Meeting Friends 水题
2016-10-04 09:01
465 查看
A. The New Year: Meeting Friends
题目连接:
http://codeforces.com/contest/723/problem/ADescription
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 4Sample Output
6Hint
题意
给你三个点,你需要找到另外一个点,使得那三个点到达那个点的距离和最小。题解:
数据范围很小,直接暴力枚举就好了。虽然答案显然就是中间那个点的位置。
代码
#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; }
相关文章推荐
- 【Codeforces Round 375 (Div 2) A】【水题】The New Year Meeting Friends
- Codeforces Round #375 (Div. 2) -- C. Polycarp at the Radio(水题)
- The New Year: Meeting Friends Codeforces Round#375-A
- Codeforces Round #100 (Div. 2) A - New Year Table
- Codeforces Round #375 (Div. 2) Polycarp at the Radio 优先队列模拟题 + 贪心
- Codeforces Round #456 (Div. 2) ——B. New Year's Eve(思路)
- Codeforces Round #150 (Div. 1) A. The Brand New Function
- Codeforces Round #375 (Div. 2)A. The New Year: Meeting Friends(水题)
- Codeforces Round #150 (Div. 2) C. The Brand New Function
- 【Codeforces Round 375 (Div 2) C】【语文题】Polycarp at the Radio
- Codeforces Round #378 (Div. 2) -- D. Kostya the Sculptor (STL水题)
- Codeforces Round #426 (Div. 2)The Meaningless Game【数学题】【水题】
- Codeforces Round #102 (Div. 2) ——A. Help Vasilisa the Wise 2
- Codeforces Round #195 (Div. 2) B. Vasily the Bear and Fly - 找规律
- Codeforces Round #258 (Div. 2) B. Sort the Array (模拟)
- Codeforces Round #234 (Div. 2) B. Inna and New Matrix of Candies
- Codeforces Round #258 (Div. 2) C. Predict Outcome of the Game
- Codeforces Round #140 (Div. 1)D The table 贪心
- Codeforces Round #188 (Div. 2) B. Strings of Power 水题
- Codeforces Round #250 (Div. 1) D. The Child and Sequence