POJ 2817 WordStack(狀態壓縮DP)

#include<iostream><br />#include<cstdio><br />#include<cstring><br />using namespace std;<br />int pow[15];<br />int dp[1<<12][10],N;<br />char word[15][25];<br />int W[15][15];<br />void init()<br />{<br />int w;<br />memset(W,0,sizeof(W));<br />for(int i = 0;i < N;++i)<br />{<br />for(int j = 0;j < N;++j)<br />{<br />if(i == j)continue;<br />int len1 = strlen(word[i]);<br />int len2 = strlen(word[j]);<br />for(int k = 0;k < len1;++k)<br />{<br />w = 0;<br />for(int h = 0;h < len2;++h)<br />{<br />if(k + h >= len1)break;<br />if(word[i][k+h] == word[j][h])++w;<br />}<br />if(W[i][j] < w)W[i][j] = W[j][i] = w;<br />}<br />}<br />}<br />}<br />int DP()<br />{<br />int ans = 0;<br />memset(dp,0,sizeof(dp));<br />for(int S = 1;S < pow[N];++S)<br />{<br />for(int i = 0;i < N;++i)<br />{<br />if((S & pow[i]) == 0)continue;<br />int pS = S ^ pow[i];<br />for(int j = 0;j < N;++j)<br />{<br />if((pS & pow[j]) == 0)continue;<br />dp[S][i] = max(dp[S][i],dp[pS][j] + W[j][i]);<br />}<br />}<br />}<br />for(int i = 0;i < N;++i)<br />if(dp[pow[N]-1][i] > ans)<br />ans = dp[pow[N]-1][i];<br />return ans;<br />}<br />int main()<br />{<br />//freopen("in.txt","r",stdin);<br />pow[0] = 1;<br />for(int i = 1;i <= 12;++i)pow[i] = pow[i-1] * 2;<br />while(scanf("%d",&N) && N)<br />{<br />for(int i = 0;i < N;++i)scanf("%s",word[i]);<br />init();<br />printf("%d/n",DP());<br />}<br />}<br />