HDU 2018 Multi-University Training Contest 4 Problem L. Graph Theory Homework

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 1 3 5

 

 

Sample Output

2

#include<bits/stdc++.h>
using namespace std;


int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        double a[200005];
        for(int i=0; i<n; i++)
            scanf("%lf",&a[i]);
        int x=sqrt(fabs(a[n-1]-a[0]));
        printf("%d\n",x);
    }