fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. const int N = 16;
  5. long long a[N][N], dp[1 << N], group_score[1 << N];
  6. int n;
  7.  
  8. int main() {
  9. ios::sync_with_stdio(false);
  10. cin.tie(nullptr);
  11.  
  12. cin >> n;
  13. for (int i = 0; i < n; ++i)
  14. for (int j = 0; j < n; ++j)
  15. cin >> a[i][j];
  16.  
  17. // Tiền xử lý điểm nhóm
  18. for (int mask = 0; mask < (1 << n); ++mask) {
  19. long long res = 0;
  20. for (int i = 0; i < n; ++i)
  21. for (int j = i + 1; j < n; ++j)
  22. if ((mask >> i & 1) && (mask >> j & 1))
  23. res += a[i][j];
  24. group_score[mask] = res;
  25. }
  26.  
  27. // DP với submask
  28. for (int mask = 0; mask < (1 << n); ++mask) {
  29. for (int sub = mask; sub; sub = (sub - 1) & mask) {
  30. dp[mask] = max(dp[mask], dp[mask ^ sub] + group_score[sub]);
  31. }
  32. }
  33.  
  34. cout << dp[(1 << n) - 1] << '\n';
  35. return 0;
  36. }
  37.  
Success #stdin #stdout 0.08s 5320KB
stdin
16
0 5 -4 -5 -8 -4 7 2 -4 0 7 0 2 -3 7 7
5 0 8 -9 3 5 2 -7 2 -7 0 -1 -4 1 -1 9
-4 8 0 -9 8 9 3 1 4 9 6 6 -6 1 8 9
-5 -9 -9 0 -7 6 4 -1 9 -3 -5 0 1 2 -4 1
-8 3 8 -7 0 -5 -9 9 1 -9 -6 -3 -8 3 4 3
-4 5 9 6 -5 0 -6 1 -2 2 0 -5 -2 3 1 2
7 2 3 4 -9 -6 0 -2 -2 -9 -3 9 -2 9 2 -5
2 -7 1 -1 9 1 -2 0 -6 0 -6 6 4 -1 -7 8
-4 2 4 9 1 -2 -2 -6 0 8 -6 -2 -4 8 7 7
0 -7 9 -3 -9 2 -9 0 8 0 0 1 -3 3 -6 -6
7 0 6 -5 -6 0 -3 -6 -6 0 0 5 7 -1 -5 3
0 -1 6 0 -3 -5 9 6 -2 1 5 0 -2 7 -8 0
2 -4 -6 1 -8 -2 -2 4 -4 -3 7 -2 0 -9 7 1
-3 1 1 2 3 3 9 -1 8 3 -1 7 -9 0 -6 -8
7 -1 8 -4 4 1 2 -7 7 -6 -5 -8 7 -6 0 -9
7 9 9 1 3 2 -5 8 7 -6 3 0 1 -8 -9 0
stdout
132