L

https://vjudge.net/contest/313233#problem/L

Sample Input

1
3
1 3 5

Sample Output

2

题意
带权值的N个点，每两点之间边长度

求1~N最短路

思路

　　

　　直接算首尾两个点
　　所以其实不算图论题
code

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <stack>
#include <cstdlib>
#include <queue>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <iterator>
#include <set>
#include <map>
#include <utility>
#include <iomanip>
#include <ctime>
#include <sstream>
#include <bitset>
#include <deque>
#include <limits>
#include <numeric>
#include <functional>

#define gc getchar()
#define mem(a) memset(a,0,sizeof(a))
#define mod 1000000007
#define sort(a,n,int) sort(a,a+n,less<int>())
#define fread() freopen("in.in","r",stdin)
#define fwrite() freopen("out.out","w",stdout)
using namespace std;

typedef long long ll;
typedef char ch;
typedef double db;

const int maxn=1e5+10;
//ll a[maxn];
int aa[maxn];


int gcd(int a,int b){
    if(a<b)swap(a,b);
    if(a%b==0)return b;
    else gcd(b,a%b);
}
int a[maxn];
int main()
{
    int T;
    int n;
    cin >> T;
    while(T--){
        cin >> n;
        for(int i = 1;i<=n;i++)
            cin >> a[i];
        int res = sqrt(abs(a[n] - a[1]) );
        cout << res << endl;
    }
}