AC Code

#include<bits/stdc++.h>
#ifndef ONLINE_JUDGE
// #define OPEN_FILE
// #define OPEN_TIME
#endif
#define AC return 0;
#define lowbit(x) (x&(-x))
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
using namespace std;
const int maxn=1e6+10,INF=0x3f3f3f3f,mod=1e9+7;
const double eps=1e-8,Pi=acos(-1);
mt19937_64 mt(1145);
int n,m;
ll mp[20][20];
ll dp[1<<17],sum[1<<17];

void solve() {
    for(int S=0;S<(1<<n);++S) {
        for(int P=S;P<(1<<n);P=(P+1)|S) {// 枚举所有 S 的超集
            int T=P^S;                   // S 的超集去掉 S 就是不交集合
            dp[S|T]=max(dp[S|T],dp[S]+sum[T]);
        }
    }
    cout<<dp[(1<<n)-1]<<'\n';
}
void init() {
    cin>>n;
    for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) 
        cin>>mp[i][j];
    // 计算每种集合的贡献
    for(int S=0;S<(1<<n);++S) {
        for(int i=1;i<=n;++i) for(int j=i+1;j<=n;++j) {
            if((S&(1<<(i-1))) && (S&(1<<(j-1)))) 
                sum[S]+=mp[i][j];
        }
    }
    memset(dp,-0x3f,sizeof(dp));
    dp[0]=0;
}
int main() {
#ifdef OPEN_FILE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
#ifdef OPEN_TIME
    auto StartTime=clock();
#endif
    // ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    int T=1;
    // cin>>T;
    // while(cin>>n) {
    while(T--) {
        init();
        solve();
    }
#ifdef OPEN_TIME
    cerr<<"used: "<<(double)(clock()-StartTime)/CLOCKS_PER_SEC*1000<<" ms"<<endl;
#endif
    AC
}