HDU - 6343 Graph Theory Homework 【水题】

Graph Theory Homework

传送门

题目

There is a complete graph containing $n$ vertices, the weight of the $i$-th vertex is $w_i$.
The length of edge between vertex $i$ and $j$ $(i̸=j)$ is $\lfloor \sqrt{|w_i-w_j|}\rfloor$.
Calculate the length of the shortest path from $1$ to $n$.

Input:

The first line of the input contains an integer $T$ $(1\le T\le 10)$ denoting the number of test cases.
Each test case starts with an integer $n$ $(1\le n\le 10^5)$ denoting the number of vertices in the graph.
The second line contains $n$ integers, the $i$-th integer denotes $w_i$ $(1\le w_i\le 10^5)$.

Output:

For each test case, print an integer denoting the length of the shortest path from $1$ to $n$.

题目大意

给你一个完全图，然后每个节点都有一个权值$w_i$，每两个点之间的距离$d=\lfloor \sqrt{|w_i-w_j|}\rfloor$，求从1到n的最短距离是多少

分析

由均值不等式与绝对值三角不等式有：
$$\sqrt{|a-b|}+\sqrt{|b-c|}\ge \sqrt{|a-b|+|b-c|}\ge \sqrt{|a-c|}$$
显然，任意两点之间，直接连接是最短的。

参考代码

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <algorithm>
#ifdef LOCAL
#define frein(x) freopen(x, "r", stdin)
#define freout(x) freopen(x, "w", stdout)
#else
#define frein(x)
#define freout(x)
#endif
#define mem(x, v)  memset(x, v, sizeof(x))
#define squ(x) ((x) * (x))
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
const int inf = 0x3f3f3f3f;
int arr[maxn];
int main(void){
    //frein("data.in");
    //freout("data.out");
    int T; cin >> T;
    while(T--){
        int n; cin >> n;
        for(int i = 1; i <= n; i++){
            cin >> arr[i];
        }
        int ans = sqrt(abs(arr[1] - arr[n]));
        cout << ans << endl;
    }
    return 0;
}