NYOJ 832 合并游戏

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <stack>
13 #define LL long long
14 #define pii pair<int,int>
15 #define INF 0x3f3f3f3f
16 using namespace std;
17 int mp[12][12],n;
18 vector<int>g[100];
19 bool vis[20480];
20 int dp[100000];
21 void init() {
22     int i,j,k,temp,v,u;
23     memset(vis,false,sizeof(vis));
24     for(i = 0; i < 100; i++) g[i].clear();
25     g[0].push_back((1<<n)-1);
26     g[n].push_back(0);
27     vis[0] = true;
28     vis[(1<<n)-1] = true;
29     for(i = 1; i <= n; i++) {
30         for(j = 0; j < g[i-1].size(); j++) {
31             temp = g[i-1][j];
32             for(k = 0; k < n; k++) {
33                 u = temp&(1<<k);
34                 if(u) {
35                     v = temp^(1<<k);
36                     if(vis[v]) continue;
37                     vis[v] = true;
38                     g[i].push_back(v);
39                 }
40             }
41         }
42     }
43 }
44 int go(int x){
45     char s[20];
46     int pos[120],m = 0,i,j,y,theMax = 0;
47     for(i = 0; i < n; i++)
48         if(x&(1<<i)) pos[m++] = i;
49     for(i = 0; i < n; i++){
50         if((x&(1<<i)) == 0){
51             y = x^(1<<i);
52             for(j = 0; j < m; j++){
53                 theMax = max(theMax,dp[y]+mp[pos[j]][i]);
54             }
55         }
56     }
57     return theMax;
58 }
59 int main() {
60     int i,j,ans;
61     while(~scanf("%d",&n)) {
62         init();
63         for(i = 0; i < n; i++) {
64             for(j = 0; j < n; j++)
65                 scanf("%d",mp[i]+j);
66         }
67         memset(dp,0,sizeof(dp));
68         for(i = 1; i <= n; i++){
69             for(j = 0; j < g[i].size(); j++){
70                 dp[g[i][j]] = go(g[i][j]);
71             }
72         }
73         for(ans = i = 0; i < g[n-1].size(); i++)
74             ans = max(ans,dp[g[n-1][i]]);
75         printf("%d\n",ans);
76     }
77     return 0;
78 }