Graph Theory Homework

最新推荐文章于 2024-10-19 12:14:30 发布

xjGenese

最新推荐文章于 2024-10-19 12:14:30 发布

阅读量462

点赞数

分类专栏：多校赛

本文链接：https://blog.csdn.net/qq_40738689/article/details/81349099

版权

多校赛专栏收录该内容

10 篇文章

订阅专栏

本文探讨了一道图论题目，涉及完全图中从顶点1到顶点n的最短路径计算问题。输入包括顶点数量及各顶点权重，通过计算不同顶点间边长来找出最短路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem L. Graph Theory Homework

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0

Problem Description

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|−−−−−−−√⌋.
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 5

Sample Output

题解：两点之间直线最短

#include <bits/stdc++.h>

using namespace std;
int a[1000005];

int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		if(a[0] > a[n-1]){
			int m = a[0];
			a[0] = a[n-1];
			a[n-1] = m;
		}
		printf("%d\n",(int)sqrt(a[n-1] - a[0]));
	} 

}