fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. // Speed
  5. #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  6.  
  7. // Typedefs
  8. #define int long long
  9. #define pb push_back
  10. #define ff first
  11. #define ss second
  12. #define all(x) (x).begin(), (x).end()
  13. #define rall(x) (x).rbegin(), (x).rend()
  14. #define sz(x) ((int)(x).size())
  15. #define endl '\n'
  16. #define yes cout << "yes\n"
  17. #define no cout << "no\n"
  18.  
  19. // Loops
  20. #define rep(i,a,b) for(int i=a;i<b;++i)
  21. #define per(i,a,b) for(int i=b-1;i>=a;--i)
  22. #define each(x, a) for (auto& x : a)
  23.  
  24. // Consts
  25. const int INF = 1e18;
  26. const int MOD = 1e9+7;
  27. const int N = 2e5 + 5;
  28.  
  29. // Math
  30. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  31. int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
  32.  
  33. int power(int a, int b, int m = MOD) {
  34. int res = 1;
  35. while (b > 0) {
  36. if (b & 1) res = res * a % m;
  37. a = a * a % m;
  38. b >>= 1;
  39. }
  40. return res;
  41. }
  42.  
  43. int modinv(int a, int m = MOD) {
  44. return power(a, m - 2, m);
  45. }
  46.  
  47. // Logic
  48. void solve() {
  49. // Code
  50. int n;
  51. cin>>n;
  52. vector <int> a(n);
  53. rep(i,0,n) cin>>a[i];
  54. int maximum=0,b,sum=0;
  55. rep(i,1,n-1){
  56. sum+=abs(a[i]-a[i+1]);
  57. maximum=max(maximum,abs(a[i]-a[i+1])+abs(a[i]-a[i-1]));
  58. if(maximum==abs(a[i]-a[i+1])+abs(a[i]-a[i-1])) b=abs(a[i]-a[i+1])+abs(a[i]-a[i-1]);
  59. }
  60. sum+=abs(a[0]-a[1]);
  61. maximum=max(b,max(abs(a[0]-a[1]),abs(a[n-1]-a[n-2])));
  62. cout<<sum-maximum<<endl;
  63. }
  64.  
  65. // Main
  66. int32_t main() {
  67. fast_io;
  68.  
  69. int t;
  70. cin >> t;
  71. while (t--) {
  72. solve();
  73. }
  74.  
  75. return 0;
  76. }
  77.  
Success #stdin #stdout 0.01s 5288KB
stdin
3
5
4 15 1 7 9
3
2 4 8
6
11 13 17 19 23 29
stdout
8
0
8