백준 10819번 차이를 최대로 C++

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

 

백트래킹으로 풀었다.

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>

using namespace std;
using ll = long long;

int n;

vector<int> v(8);
vector<int> idxs;
vector<bool> visited(8, false);

int ans = 0;

void Solve() {
	int val = 0;
	for (int i = 0; i < n - 1; i++) {
		val += abs(v[idxs[i]] - v[idxs[i + 1]]);
	}
	ans = max(ans, val);
}

void BT() {
	if (idxs.size() >= n) {
		Solve();
		return;
	}
	for (int i = 0; i < n; i++) {
		if (visited[i]) continue;
		visited[i] = true;
		idxs.push_back(i);
		BT();
		visited[i] = false;
		idxs.pop_back();
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	BT();
	cout << ans;
};