Day 4 L - Graph Theory Homework HDU 6343 | 水题 | 思维

题目中要求的是从编号为1的点到编号为n的点的最短路径，所以必然是直接从1到n。不过要注意只有一个点的情况orz。忘记这个WA了一发。

#include <bits/stdc++.h>

using namespace std;

int T, n, first, last, ans;

int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        for(int i = 1;i <= n;i++)
        {
            int x;
            if(i == 1)
            {
                scanf("%d", &x);
                first = x;
                continue;
            }
            if(i == n)
            {
                scanf("%d", &x);
                last = x;
                continue;
            }
            scanf("%d", &x);
        }

        if(n == 1)
        {
            printf("0\n");
            continue;
        }

        //printf("%d %d\n", first ,last);
        ans = abs(first - last);
        //printf("%d\n", ans);
        ans = sqrt(ans);
        //printf("%d\n", ans);

        printf("%d\n", ans);
    }
    return 0;
}