#include #define FASTIO using namespace std; using ll = long long; using Vi = std::vector; using Vl = std::vector; using Pii = std::pair; using Pll = std::pair; constexpr int I_INF = std::numeric_limits::max(); constexpr ll L_INF = std::numeric_limits::max(); template inline bool chmin(T1& a, const T2& b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1& a, const T2& b) { if (a < b) { a = b; return true; } return false; } template class Prints { private: class __Prints { public: __Prints(const char* sep, const char* term) : sep(sep), term(term) {} template auto operator()(const Args&... args) const -> decltype((os << ... << std::declval()), void()) { print(args...); } template auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval()[0])>(), void()) { for (size_t i = 0; i < sz; i++) os << vec[i] << (i == sz - 1 ? term : sep); } template auto pmat(const T& mat, size_t h, size_t w) -> decltype(os << std::declval()[0][0])>(), void()) { for (size_t i = 0; i < h; i++) for (size_t j = 0; j < w; j++) os << mat[i][j] << (j == w - 1 ? term : sep); } private: const char *sep, *term; void print() const { os << term; } void print_rest() const { os << term; } template void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); } template void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); } }; public: Prints() {} __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); } }; Prints<> prints; Prints prints_err; //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% void solve() { int N; cin >> N; vector F(N, Vi(N)); for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { cin >> F[i][j]; } } map dp; auto dfs = [&](auto&& self, int S) -> int { if (auto itr = dp.find(S); itr != dp.end()) return itr->second; if (S == (1 << N) - 1) return 0; int idx = 0; while (idx < N && S >> idx & 1) ++idx; int res = 0; for (ll i = idx + 1; i < N; i++) { if (~S >> i & 1) { chmax(res, self(self, S | (1 << idx) | (1 << i)) + F[idx][i]); } } dp[S] = res; return res; }; prints()(dfs(dfs, 0)); } //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% int main() { #ifdef FASTIO std::cin.tie(nullptr), std::cout.tie(nullptr); std::ios::sync_with_stdio(false); #endif #ifdef FILEINPUT std::ifstream ifs("./in_out/input.txt"); std::cin.rdbuf(ifs.rdbuf()); #endif #ifdef FILEOUTPUT std::ofstream ofs("./in_out/output.txt"); std::cout.rdbuf(ofs.rdbuf()); #endif std::cout << std::setprecision(18) << std::fixed; solve(); std::cout << std::flush; return 0; }