本文主要是介绍http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2467cid=1131，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Steps
Time Limit: 3000MS Memory limit: 65536K
题目描述
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. For each test case, a line follows with two integers: 0<= x <= y < 231
输出
For each test case, print a line giving the minimum number of steps to get from xto y.
示例输入
3 45 48 45 49 45 50
示例输出
3 3 4
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{int n,x,y;scanf("%d",&n);while(n--){scanf("%d%d",&x,&y);int dis=y-x,ans=0,flag=1,sum=0,k=0;while(ans<dis){if(flag==1)k++;ans+=k;flag*=-1;sum++;}printf("%d\n",sum);}
}
这篇关于http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2467cid=1131的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
