最近开始复习dp
又看了一遍背包九讲这种大神级论文
多重背包:poj 1014 dividing
将多重背包拆分,转换成01背包
Problem: 1014 | User: hcy_ray | |
Memory: 416K | Time: 16MS | |
Language: C++ | Result: Accepted |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<limits.h>
#include<math.h>
int f[1000000];
int v[1001],w[1001],k[6];
int max(int a,int b)
{
if (a>b) return a; else return b;
}
int main()
{
int m,T,y,ans,s;
T=0;
scanf("%d%d%d%d%d%d",&k[1],&k[2],&k[3],&k[4],&k[5],&k[6]);
while (k[1]!=0 || k[2]!=0 || k[3]!=0 || k[4]!=0 || k[5]!=0 || k[6]!=0)
{
T++;
m=0;
s=0;
for (int i=1;i<=6;i++)
if (k[i]!=0){
m++;
k[m]=k[i];
v[m]=i;
s=s+v[m]*k[m];
}
if ((s%2)==1) printf("Collection #%d:\nCan't be divided.\n\n",T);
else{
s=s/2;
for (int i=0;i<=s;i++) f[i]=0;
for (int i=1;i<=m;i++)
{
int p=1;
while (p<k[i])
{
for (int j=s;j>=p*v[i];j--)
f[j]=max(f[j],f[j-v[i]*p]+v[i]*p);
k[i]=k[i]-p;
p=p*2;
}
for (int j=s;j>=k[i]*v[i];j--)
f[j]=max(f[j],f[j-v[i]*k[i]]+v[i]*k[i]);
}
if (f[s]==s) printf("Collection #%d:\nCan be divided.\n\n",T);
else printf("Collection #%d:\nCan't be divided.\n\n",T);
}
scanf("%d%d%d%d%d%d",&k[1],&k[2],&k[3],&k[4],&k[5],&k[6]);
}
}
二维费用背包:poj 1948 Triangular Pastures
本质依然是01背包
Problem: 1948 | User: hcy_ray | |
Memory: 636K | Time: 141MS | |
Language: C++ | Result: Accepted |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
bool f[1000][1000];
int a[100];
int s;
int tri(int a,int b,int c)
{
double p;
p=(a+b+c)/2.0;
return (int)(100*sqrt(p*(p-a)*(p-b)*(p-c)));
}
int main()
{
int n;
s=0;
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
s=s+a[i];
}
for (int i=0;i<=s/2+1;i++)
for (int j=0;j<=s/2+1;j++)
f[i][j]=false;
f[0][0]=true;
for (int i=1;i<=n;i++)
for (int j=s/2+1;j>=0;j--)
for (int k=s/2+1;k>=0;k--)
if (j>=a[i] && f[j-a[i]][k] || f[j][k-a[i]]&& k>=a[i]) f[j][k]=true;
int ans=-1;
for (int i=1;i<=s/2+1;i++)
for (int j=1;j<=s/2+1;j++)
if (f[i][j] && (s-i-j>0)) if (ans<tri(i,j,s-i-j)) ans=tri(i,j,s-i-j);
printf("%d\n",ans);
return 0;
}
分组背包:hdu 3033 i love sneakers!
由于至少取一个,稍有变形,必须用到二维,防止前一个组中的所取的物品被后续冲掉
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
int a[1000][1000],f[11][10001],w[1000],v[1000];
int max(int a,int b)
{
if (a>b) return a;else return b;
}
int main()
{
int n,m,k,x,t;
while(scanf("%d%d%d",&n,&m,&k)==3)
{
memset(a,0,sizeof(a));
memset(f,-1,sizeof(f));
for (int i=0;i<=k;i++)
for (int j=0;j<=m;j++)
f[i][j]=-INT_MAX;
for (int i=1;i<=m;i++) f[0][i]=0;
for (int i=1;i<=n;i++)
{
scanf("%d%d%d",&x,&w[i],&v[i]);
a[x][0]++;
a[x][a[x][0]]=i;
}
for (int i=1;i<=k;i++)
for (int j=1;j<=a[i][0];j++)
for (int kk=m;kk>=0;kk--)
{
t=a[i][j];
if (kk>=w[t]) {
if (f[i][kk-w[t]]!=-INT_MAX) f[i][kk]=max(f[i][kk],f[i][kk-w[t]]+v[t]);
if (f[i-1][kk-w[t]]!=-INT_MAX) f[i][kk]=max(f[i][kk],f[i-1][kk-w[t]]+v[t]);
}
}
if (f[k][m]<=0) printf("Impossible\n"); else printf("%d\n",f[k][m]);
}
return 0;
}