UVA - 846 Steps

最新推荐文章于 2020-04-14 23:10:26 发布

苏摩夜

最新推荐文章于 2020-04-14 23:10:26 发布

阅读量407

点赞数

分类专栏：数学文章标签： uva UVA - 846 Steps

本文链接：https://blog.csdn.net/zz_FreeSky/article/details/38469129

版权

数学专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Steps

One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous step.

What is the minimum number of steps in order to get from x to y? The length of the first and the last step must be 1.

Input consists of a line containing n, the number of test cases. Foreach test case, a line follows with two integers: 0 $\le$ x $\le$ y < 2³¹.For each test case, print a line giving the minimum number of steps toget from x to y.

Sample Input

Sample Output

3
3
4



所走步数对应的序列如果左右对称，那么所走的步数应该是最少的。由于第一步和最后一步长度均必须是1，又由于每一步的长度必须大于0，且要么比上一步步长要
么大于 1，要么相等，要么小 1，则左右对称的序列能在最少步数得到最大距离。

 1 + 2 + 3 + ... + （n - 1） + n +  （n - 1） + ... + 3 + 2 + 1 = n^2。比较两点距离 与 n^2 之间的关系即可

#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;

int main()
{
	int n;
	int x;
	int y;
	int d;
	cin >> n;
	while(n --)
	{
		cin >> x >> y;
		d = y - x;
		int m = sqrt(d);

		if(d <= 3)
			cout << d<<endl;
		else
		{
			if(d == m*m)
				cout << 2*m -1<<endl;
			else if(d - m*m <= m)	
				cout << 2*m<<endl;
			else
				cout << 2*m + 1<<endl;
		
		}
	}
return 0;

}