Problem L. Graph Theory Homework HDU - 6343
There is a complete graph containing n vertices, the weight of the i-th vertex is wi.
The length of edge between vertex i and j (i≠j) is
⌊|wi−wj|−−−−−−−√⌋
⌊
|
w
i
−
w
j
|
⌋
.
Calculate the length of the shortest path from 1 to n
.
Input
The first line of the input contains an integer T (1≤T≤10) denoting the number of test cases.
Each test case starts with an integer n (1≤n≤105) denoting the number of vertices in the graph.
The second line contains n integers, the i-th integer denotes wi (1≤wi≤105)
.
Output
For each test case, print an integer denoting the length of the shortest path from 1 to n
.
Sample Input
1
3
1 3 5
Sample Output
2
题意:
给出每个点的权值,告诉了是一个完全图,并告诉了每条边怎么算,求1-n的最短路
分析:
我们假设中间有一个过渡点可以使得边松弛后更短,假设为k
⌊|w1−wn|−−−−−−−−√⌋>⌊|w1−wk|−−−−−−−−√⌋+⌊|wk−wn|−−−−−−−−√⌋ ⌊ | w 1 − w n | ⌋ > ⌊ | w 1 − w k | ⌋ + ⌊ | w k − w n | ⌋
两边平方后得到
w1−wn>w1−wn+2|w1−wk|−−−−−−−−√|wk−wn|−−−−−−−−√ w 1 − w n > w 1 − w n + 2 | w 1 − w k | | w k − w n |
很明显一定右边更大,矛盾
所以只需要直接求1和n的边长就是最短路。
code:
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
int a[100010];
scanf("%d",&n);
for(int i = 1; i <= n; i++){
scanf("%d",&a[i]);
}
int tmp = abs(a[n] - a[1]);
printf("%d\n",(int)sqrt(tmp*1.0));
}
return 0;
}