codeforces AIM Tech Round 3 (Div. 2) B. Checkpoints
2016-08-25 13:18
549 查看
Vasya takes part in the orienteering competition. There are n checkpoints located along the line at coordinates x1, x2, ..., xn.
Vasya starts at the point with coordinate a. His goal is to visit at least n - 1 checkpoint
in order to finish the competition. Participant are allowed to visit checkpoints in arbitrary order.
Vasya wants to pick such checkpoints and the order of visiting them that the total distance travelled is minimized. He asks you to calculate this minimum possible value.
Input
The first line of the input contains two integers n and a (1 ≤ n ≤ 100 000, - 1 000 000 ≤ a ≤ 1 000 000) —
the number of checkpoints and Vasya's starting position respectively.
The second line contains n integers x1, x2, ..., xn ( - 1 000 000 ≤ xi ≤ 1 000 000) —
coordinates of the checkpoints.
Output
Print one integer — the minimum distance Vasya has to travel in order to visit at least n - 1 checkpoint.
题解在这里:http://blog.csdn.net/queuelovestack/article/details/52311222
AC代码:
# include <iostream>
# include <math.h>
# include <stdlib.h>
# include <algorithm>
# include <limits.h>
using namespace std;
int a[100010];
int main(){
int i, j, k, n, b, Min=INT_MAX;
cin>>n>>b;
for(i=1; i<=n; i++){
cin>>a[i];
}
if(n==1){cout<<0;return 0;}
sort(a+1, a+n+1);
if(b<=a[1]){cout<<a[n-1]-b;return 0;}
if(b>=a
){cout<<b-a[2];return 0;}
Min=min(Min, abs(b-a[1])+abs(a[1]-a[n-1]));
Min=min(Min, abs(b-a[2])+abs(a[2]-a
));
Min=min(Min, abs(b-a
)+abs(a
-a[2]));
Min=min(Min, abs(b-a[n-1])+abs(a[n-1]-a[1]));
cout<<Min;
return 0;
}
Vasya starts at the point with coordinate a. His goal is to visit at least n - 1 checkpoint
in order to finish the competition. Participant are allowed to visit checkpoints in arbitrary order.
Vasya wants to pick such checkpoints and the order of visiting them that the total distance travelled is minimized. He asks you to calculate this minimum possible value.
Input
The first line of the input contains two integers n and a (1 ≤ n ≤ 100 000, - 1 000 000 ≤ a ≤ 1 000 000) —
the number of checkpoints and Vasya's starting position respectively.
The second line contains n integers x1, x2, ..., xn ( - 1 000 000 ≤ xi ≤ 1 000 000) —
coordinates of the checkpoints.
Output
Print one integer — the minimum distance Vasya has to travel in order to visit at least n - 1 checkpoint.
题解在这里:http://blog.csdn.net/queuelovestack/article/details/52311222
AC代码:
# include <iostream>
# include <math.h>
# include <stdlib.h>
# include <algorithm>
# include <limits.h>
using namespace std;
int a[100010];
int main(){
int i, j, k, n, b, Min=INT_MAX;
cin>>n>>b;
for(i=1; i<=n; i++){
cin>>a[i];
}
if(n==1){cout<<0;return 0;}
sort(a+1, a+n+1);
if(b<=a[1]){cout<<a[n-1]-b;return 0;}
if(b>=a
){cout<<b-a[2];return 0;}
Min=min(Min, abs(b-a[1])+abs(a[1]-a[n-1]));
Min=min(Min, abs(b-a[2])+abs(a[2]-a
));
Min=min(Min, abs(b-a
)+abs(a
-a[2]));
Min=min(Min, abs(b-a[n-1])+abs(a[n-1]-a[1]));
cout<<Min;
return 0;
}
相关文章推荐
- codeforces AIM Tech Round 3 (Div. 2) B. Checkpoints
- codeforces AIM Tech Round 3 (Div. 2)
- codeforces AIM Tech Round 3 (Div. 2) (A~D)
- Codeforces AIM Tech Round 4 (Div. 2) A Diversity
- Codeforces AIM Tech Round (Div. 1) A Graph and String 想法
- codeforces AIM Tech Round 3 (Div. 2)D. Recover the String
- Codeforces AIM Tech Round (Div. 2)
- Codeforces AIM Tech Round 4 (Div. 2) B Rectangles(组合数学)
- Codeforces AIM Tech Round (Div. 2) A. Save Luke
- Codeforces AIM Tech Round 4 (Div. 2) C Sorting by Subsequences (dfs)
- Codeforces AIM Tech Round (Div. 1) ABD
- Codeforces AIM Tech Round (Div. 2)解题报告
- Codeforces AIM Tech Round (Div. 2) A. Save Luke
- CodeForces AIM Tech Round 3 (Div. 1) 题解(CF708A,CF708B,CF708C,CF708D,CF708E)
- Codeforces AIM Tech Round (Div. 1)623A Graph and String
- Codeforces AIM Tech Round 4 (Div. 2) A. Diversity
- CodeForces AIM Tech Round 3 (Div. 2) D
- Codeforces AIM Tech Round (Div. 2) 624B Making a String
- (组合)Codeforces AIM Tech Round 4 (Div. 2) B. Rectangles
- Codeforces AIM Tech Round (Div. 2) 题解