10819번 차이를 최대로(next_permutation 활용)

https://www.acmicpc.net/problem/10819

next_permutation 이란? http://hsdevelopment.tistory.com/216

단순 백트래킹으로 풀었을 때 = http://hsdevelopment.tistory.com/153

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
 
using namespace std;
 
int main(void)
{
    int N = 0, num = 0, result = -1;
 
    vector<int> v;
 
    scanf("%d", &N);
 
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &num);
        v.push_back(num);
    }
 
    sort(v.begin(), v.end());
 
    while (next_permutation(v.begin(), v.end()))
    {
        int sum = 0;
 
        for (int i = 0; i < v.size() - 1; i++)
        {
            sum += abs(v.at(i) - v.at(i + 1));
        }
 
        result = max(result, sum);
    }
 
    printf("%d\n", result);
 
    return 0;
}