codeforce D. Kefa and Dishes（状压dp）

题目链接
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
inputCopy
2 2 1
1 1
2 1 1
outputCopy
3
inputCopy
4 3 2
1 2 3 4
2 1 5
3 4 2
outputCopy
12
Note
In the first sample it is best to first eat the second dish, then the first one. Then we get one unit of satisfaction for each dish and plus one more for the rule.

In the second test the fitting sequences of choice are 4 2 1 or 2 1 4. In both cases we get satisfaction 7 for dishes and also, if we fulfill rule 1, we get an additional satisfaction 5.

分析：

有n道菜，从中选择m道菜，每道菜有一个令人满意的数值a[i],并且如果前一道菜吃的是x，接下来吃的是y，则满意值会增加b[x][y],求最大的满意值。
运用状压dp，dp[i][j]：i表示最后一道菜，j表示状态。枚举所有可能的状态，接着枚举最后一道菜，再枚举倒数第二道菜。
dp[i][q]=max(dp[i][q],dp[j][q-(1<<i)]+b[j][i]+a[i])
注意：要用long long

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
#define ll long long
#define eps 1e-8
#define pi acos(-1)
const int N = 1<<19;
ll a[20],b[20][20],dp[20][N];
int get(int x)
{
	int sum=0;
	while(x)
	{
		sum++;
		x=x&(x-1);
	}
	return sum;
}
int main()
{
	int n,m,k; 
	scanf("%d%d%d",&n,&m,&k);//n道菜，选择m道菜，有k种规则 
	for(int i=0;i<n;i++)
	{
		scanf("%lld",&a[i]);//每道菜的满意值 
	}
	int x,y;
	ll z;
	for(int i=1;i<=k;i++)
	{
		scanf("%d%d%lld",&x,&y,&z);//先吃x，再吃y，满意值增加z 
		x--,y--;
		b[x][y]=z;
	}
	int p=1<<n;
	ll ans=0;
	for(int q=0;q<p;q++)//枚举所有状态 
	{
		int sum=get(q);//计算每个状态中1的个数，即吃了几道菜 
		for(int i=0;i<n;i++)//枚举最后一道菜 
		{
			if((q&(1<<i))==0) continue;//第i道菜必须包含在这个状态 
			dp[i][q]=a[i];
			for(int j=0;j<n;j++)//枚举倒数第二道菜 
			{
				if((i==j)||((q&(1<<j))==0)) continue;//最后一道菜和倒数第二道菜不能是一样的
				//并且倒数第二道菜也要包含在这个状态 
				dp[i][q]=max(dp[i][q],dp[j][q-(1<<i)]+b[j][i]+a[i]);
			} 
			if(sum==m) ans=max(ans,dp[i][q]);
		}
	}
	printf("%lld",ans);
	return 0;
}