[백준 10819번] 차이를 최대로

소스코드

---

#include <iostream>
using namespace std;
 
int n,num[9],Max=-98765;
 
int cal_sum(int* num) {
    int sum = 0;
    for (int i = 2; i <= n; i++) {
        int a = num[i - 2] - num[i - 1];
        if (a < 0)
            sum += (-1 * a);
        else
            sum += a;
    }
    return sum;
}
 
void cal(int* num, int start, int end) {
    if (start == end) {
        int sum = cal_sum(num);
        if (sum > Max)
            Max = sum;
        return;
    }
    for (int i = start; i <= end; i++) {
        int tmp = num[start];
        num[start] = num[i];
        num[i] = tmp;
        cal(num, start+1, end);
        tmp = num[start];
        num[start] = num[i];
        num[i] = tmp;
    }
}
 
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }
    cal(num,0, n-1);
    cout << Max << '\n';
    return 0;
}