最小斯坦纳树

之前把斯坦纳树的题目放在状压dp里，现在觉得还是应该新建一个专题。毕竟斯坦纳树的dp转移自成一套，和其他的状压dp转移有很大区别。

#include <bits/stdc++.h>
using namespace std;
const int N=105,M=505,K=10;
int n,m,k,u,v,w,x,max_statue,inf;
int f[N][1<<K];
bool vis[N];
int cnt,head[N];
struct edge{int next,to,w;}e[M<<1];
struct node
{
	int id,dis;
	inline bool operator < (const node &x) const
	{
		return x.dis<dis;
	}
};

inline void add(int u,int v,int w)
{
	cnt++;
	e[cnt].next=head[u];
	e[cnt].to=v;
	e[cnt].w=w;
	head[u]=cnt;
}

priority_queue<node>q;
inline void dij(int p)
{
	memset(vis,false,sizeof(vis));
	while (q.size())
	{
		node u=q.top(); q.pop();
		if (vis[u.id]) continue;
		vis[u.id]=true;
		int x=u.id;
		for (register int i=head[x]; i; i=e[i].next)
		if (f[e[i].to][p]>f[x][p]+e[i].w)
		{
			f[e[i].to][p]=f[x][p]+e[i].w;
			q.push((node){e[i].to,f[e[i].to][p]});
		}
	}
}

int main(){
	scanf("%d%d%d",&n,&m,&k);
	for (register int i=1; i<=m; ++i)
	{
		scanf("%d%d%d",&u,&v,&w);
		add(u,v,w); add(v,u,w);
	}
	memset(f,60,sizeof(f)); inf=f[0][0];
	for (register int i=1; i<=k; ++i) scanf("%d",&x),f[x][1<<(i-1)]=0;
	max_statue=(1<<k)-1;
	for (register int p=1; p<=max_statue; ++p)
	{
		for (register int i=1; i<=n; ++i)
		{
			for (register int pp=p; pp; pp=p&(pp-1)) f[i][p]=min(f[i][p],f[i][pp]+f[i][p^pp]);
			if (f[i][p]!=inf) q.push((node){i,f[i][p]});		
		}
		dij(p);
	}
	printf("%d\n",f[x][max_statue]);
return 0;
}