58分求调

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=18;
int n,m;
int dp[1<<N][N];
vector<pair<int,int> >g[N];
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		u++,v++;
		g[u].push_back({v,w});
	}
	memset(dp,-0x3f,sizeof dp);
	dp[1][1]=0;
	for(int S=0;S<(1<<n);S++){
		for(int j=1;j<=n;j++){
			if(!(S&(1<<(j-1))))continue;
			for(int i=0;i<g[j].size();i++){
				int v=g[j][i].first,w=g[j][i].second;
				if(S&(1<<(v-1)))continue;
				dp[S|(1<<(v-1))][v]=max(dp[S|(1<<(v-1))][v],dp[S][j]+w);
			} 
		}
	}
	cout<<dp[(1<<n)-1][n];
	return 0;
}