10819 차이를 최대로

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>
#include <stdio.h>
#include <math.h>
#include <sstream>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using iis = pair<int, string>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

int main() {
    int n;
    scanf("%d", &n);
    
    vector<int> v(n);
    for (int i = 0; i < n; i++) 
        scanf("%d", &v[i]);
    
    int ans = 0;
    do {
		int calcResult = 0;
		
		for (int i = 1; i < n; i++) {
		    calcResult += abs(v[i] - v[i-1]);
		}
		
		for (int i = 0; i < n; i++) {
		    printf("%d ", v[i]);
		}
		printf("\n");
		
		ans = max(ans, calcResult);
		
	} while (next_permutation(v.begin(), v.end()));
    
    printf("%d\n", ans);
    
    return 0;
}