HDU1030 Delta-wave

最新推荐文章于 2018-08-13 20:17:58 发布

转载最新推荐文章于 2018-08-13 20:17:58 发布 · 159 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zxy160/p/7215151.html

本文介绍了一个基于整数编号三角形区域的最短路径问题，通过数学计算确定两点间最短距离。输入为两个整数M和N，输出为从M到N的最短路径长度。示例输入为612，输出为3。文章提供了C++实现代码。

这里写图片描述
A triangle field is numbered with successive integers in the way shown on the picture below.
The traveller needs to go from the cell with number M to the cell with number N. The traveller is able to enter the cell through cell edges only, he can not travel from cell to cell through vertices. The number of edges the traveller passes makes the length of the traveller’s route.

Write the program to determine the length of the shortest route connecting cells with numbers N and M.

Input
Input contains two integer numbers M and N in the range from 1 to 1000000000 separated with space(s).

Output
Output should contain the length of the shortest route.

Sample Input
6 12

Sample Output
3
理解链接：http://blog.youkuaiyun.com/moonspiritacm/article/details/53969418
我还没懂~~

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
    long long int m,n;
    while(~scanf("%lld%lld",&n,&m))
    {
        int a1,a2,b1,b2,c1,c2;
        a1=sqrt(n-1)+1;
        a2=sqrt(m-1)+1;
        b1=(a1*a1-n)/2+1;
        b2=(a2*a2-m)/2+1;
        c1=(n-(a1-1)*(a1-1)+1)/2;
        c2=(m-(a2-1)*(a2-1)+1)/2;
        printf("%d\n",abs(a1-a2)+abs(c1-c2)+abs(b1-b2));
    }
    return 0;
}