题意:中文题。
分析:状压dp,设dp[i][j]表示选择了i集合的数放在前面那些位置并且最后一个是a[j]时的最大值。转移的话直接找可行状态转移到下一个可行状态即可。
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=100010;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int MAX=2000000010;
const ll INF=1ll<<55;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int a[20],q[20],p[20],g[70000],dp[70000][20];
void deal() {
memset(g,0,sizeof(g));
for (int i=0;i<(1<<16);i++)
for (int j=i;j;j-=j&-j) g[i]++;
}
int main()
{
int i,j,k,n,t,w,ca,ans;
scanf("%d", &t);
deal();
for (ca=1;ca<=t;ca++) {
scanf("%d", &n);
memset(p,0,sizeof(p));
memset(q,0,sizeof(q));
for (i=1;i<=n;i++) {
scanf("%d%d", &a[i], &w);
if (w>=0) q[i]=w+1,p[w+1]=i;
}
for (i=0;i<(1<<n);i++)
for (j=0;j<=n;j++) dp[i][j]=-MAX;
dp[0][0]=0;a[0]=0;
for (i=0;i<(1<<n);i++)
for (j=0;j<=n;j++)
if (dp[i][j]!=-MAX) {
if (p[g[i]+1]!=0) dp[i+(1<<p[g[i]+1]-1)][p[g[i]+1]]=max(dp[i+(1<<p[g[i]+1]-1)][p[g[i]+1]],dp[i][j]+a[j]*a[p[g[i]+1]]);
else {
for (k=1;k<=n;k++)
if ((i&1<<k-1)==0&&q[k]==0) dp[i+(1<<k-1)][k]=max(dp[i+(1<<k-1)][k],dp[i][j]+a[j]*a[k]);
}
}
ans=-MAX;
for (i=1;i<=n;i++) ans=max(ans,dp[(1<<n)-1][i]);
printf("Case #%d:\n%d\n", ca, ans);
}
return 0;
}