题面:
题目大意:
一条数轴上有a,b两个点,可以从a瞬移到b点,问从开始A到终点B最短距离。
思路:
难度类似A+B的水题。。。直接比较三种情况就行。
A->B
A->a->b->B
A->b->a->B
ac代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include <vector>
#include<algorithm>
using namespace std;
typedef long long ll;
#define MAX 100005
#define INF 10000000
int Min(int a,int b)
{
if(a>b)return b;
else
return a;
}
int main()
{
int a,b,x,y;
scanf("%d %d %d %d",&a,&b,&x,&y);
int min = b-a>0?b-a:a-b;
int x1 = (a-x)>0?a-x:x-a;//a到x
int x2 = (a-y)>0?a-y:y-a;//a到y
int y1 = (b-x)>0?b-x:x-b;//b到x
int y2 = (b-y)>0?b-y:y-b;//b到y
if(x == y)printf("%d",min);
min = Min(min,(x1+y2));
min = Min(min,(y1+x2));
printf("%d",min);
return 0;
}