백준 10819 차이를 최대로 - 브루트포스(순열 구하기) c++

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
 
int N,answer;
int arr[9];
bool isselected[9];
vector<int> v;
 
void dfs(int cnt){
    if(cnt==N){
        int sum=0;
        for(int i=0; i<v.size()-1; i++){
            sum = sum + abs(v[i]-v[i+1]);
        }
        answer = max(answer,sum);
        return;
    }
    else{
        for(int i=0; i<N; i++){
            if(isselected[i]==true)
                continue;
            v.push_back(arr[i]);
            isselected[i]=true;
            dfs(cnt+1);
            isselected[i]=false;
            v.pop_back();
        }
    }
}
 
int main(void){
    cin>>N;
    for(int i=0; i<N; i++)
        cin>>arr[i];
    dfs(0);
    cout<<answer;
    
}