codeforces 580 D.Kefa and Dishes(状压DP）

D. Kefa and Dishes

原题：http://codeforces.com/contest/580/problem/D




When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There were n dishes. Kefa knows that he needs exactly m dishes. But at that, he doesn't want to order the same dish twice to taste as many dishes as possible.


Kefa knows that the i-th dish gives him ai units of satisfaction. But some dishes do not go well together and some dishes go very well together. Kefa set to himself k rules of eating food of the following type — if he eats dish x exactly before dish y (there should be no other dishes between x and y), then his satisfaction level raises by c.


Of course, our parrot wants to get some maximal possible satisfaction from going to the restaurant. Help him in this hard task!


Input
The first line of the input contains three space-separated numbers, n, m and k (1 ≤ m ≤ n ≤ 18, 0 ≤ k ≤ n * (n - 1)) — the number of dishes on the menu, the number of portions Kefa needs to eat to get full and the number of eating rules.


The second line contains n space-separated numbers ai, (0 ≤ ai ≤ 109) — the satisfaction he gets from the i-th dish.


Next k lines contain the rules. The i-th rule is described by the three numbers xi, yi and ci (1 ≤ xi, yi ≤ n, 0 ≤ ci ≤ 109). That means that if you eat dish xi right before dish yi, then the Kefa's satisfaction increases by ci. It is guaranteed that there are no such pairs of indexes i and j (1 ≤ i < j ≤ k), that xi = xj and yi = yj.


Output
In the single line of the output print the maximum satisfaction that Kefa can get from going to the restaurant.


这是一个状态压缩水题，dp[a][b]，a转化成2进制，第几位为1表示第几盘菜被点了，b表示当前状态下的最后一盘菜是什么。dp记录的是在当前状态下最大的满意度。转移就是dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+ma[j][k]+s[k]);
具体的看代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#define MAXN 18
using namespace std;


long long ma[20][20];
long long int s[MAXN+10];
long long dp[1<<MAXN][MAXN+10];


int main()
{
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=0; i<n; i++)
	{
		cin>>s[i];
	}
	memset(ma,0,sizeof(ma));
	for(int i=0; i<k; i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		a--;
		b--;
		ma[a][b]=c;
	}
	memset(dp,-1,sizeof(dp));
	for(int i=0;i<n;i++)
	{
		dp[1<<i][i]=s[i];                                                   //初始化。
	}
	long long ans=0;
	for(int i=0; i<(1<<n); i++)
	{
		long long tmp=i;
		long long cou=0;                               //cou记录了是当前取了多少个
		while(tmp>0)
		{
			if(tmp&1)
				cou++;
			tmp>>=1LL;
		}
		int check=0;
		if(cou==m)                            //如果恰好取了m个的话，
			check=1;                      //表示这个状态是可以取的，用check标记
		for(int j=0; j<n; j++)
		{
			if(dp[i][j]==-1)
				continue;
			if(check)
				ans=max(ans,dp[i][j]);
			for(int k=0; k<n; k++)
			{
				if(i&(1<<k))
					continue;
				dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+s[k]+ma[j][k]);
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}