#include #include using namespace std; int n; int arr[22][22]; bool check[22]; int ans = INT_MAX; void DFS(int x, int L) { if (x == n / 2) { int start, link; start = 0; link = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (check[i] == true && chek[j] == true) { start += arr[i][j]; } if (check[i] == false && check[j] == false) { link += arr[i][j]; } } } int temp = abs(start - ..