F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Problem L. Graph Theory Homework

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


Problem Description
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 \neq 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$.
 

Sample Input
1 3 1 3 5
 

Sample Output
2
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-03-29 05:39:09, Gzip enabled