题目:click
题意:给定n个题目,如果要AC第i个,那么需要先AC指定的pj个题目,获得分数为t*a[i]+b[i],问最大获得的分数是多少。
状态属性是MAX,但是由牵制条件,n个题目直接可以状态压缩。但是二维的dp显然会T和内存超限,改为一维的数组即可。
#include<cmath>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<istream>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<queue>
#define inf 0x3f3f3f3f
#define MAX_len 50100*4
using namespace std;
typedef long long ll;
ll a[21],b[21],c[21];
ll dp[(1<<20)];
ll solve(ll n)
{
ll cnt=0;
while(n)
{
if(n&1)
cnt++;
n>>=1;
}
return cnt;
}
int main()
{
memset(dp,-1,sizeof(dp));
ll n,i,j,k;
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
ll temp;
scanf("%lld %lld %lld",&a[i],&b[i],&temp);
ll sum=0;
if(!temp)
{
dp[(1<<(i-1))]=a[i]+b[i];
c[i]=0;
continue;
}
for(j=0;j<temp;j++)
{
ll tmp;
scanf("%lld",&tmp);
sum+=(1<<(tmp-1));
}
c[i]=sum;
}
ll yyyy=(1<<n);
for(i=0;i<yyyy;i++)
{
for(j=1;j<=n;j++)
{
if((((1<<(j-1))&i))||(c[j]&i)!=c[j])
continue;
if(dp[i]==-1)
continue;
ll temp=(1<<(j-1))|i;
ll tmp=solve(temp);
dp[temp]=max(dp[temp],dp[i]+a[j]*tmp+b[j]);
}
}
ll ans=0;
for(i=0;i<yyyy;i++)
{
ans=max(ans,dp[i]);
}
printf("%lld",ans);
return 0;
}