삼성문제
-
스타트와 링크백준알고리즘 2019. 8. 8. 23:48
#include #include #include using namespace std; int s[20][20]; int n; int go(int index, vector& a, vector& b) { if (index == n) { if (a.size() != n / 2) return -1; if (b.size() != n / 2) return -1; int t1 = 0; int t2 = 0; for (int i = 0; i < n / 2; i++) { for (int j = 0; j < n / 2; j++) { if (i == j) continue; t1 += s[a[i]][a[j]]; t2 += s[b[i]][b[j]]; } } int diff = t1 - t2; if (diff < 0) diff =..