1.BOJ1665
裸的背包啊。但是呢,如果不先按x排好序的话后面的就加不上啦!原来的背包只是看容积的!但是现在不是容积符合就可以的啦!
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,l,b;
struct node
{
int x,w,f,c;
}fall[10010];
int dp[1010][1010];
inline bool cmp(const node & a,const node & b)
{
return a.x<b.x;
}
int main()
{
int i,j;
while(scanf("%d%d%d",&l,&n,&b)!=EOF)
{
int flag = 0;
for(i = 0;i<n;i++)
{
scanf("%d%d%d%d",&fall[i].x,&fall[i].w,&fall[i].f,&fall[i].c);
if(fall[i].x==0)flag = 1;
}
if(!flag){printf("-1/n");continue;}
memset(dp,-1,sizeof(dp));
dp[0][0] = 0;
sort(fall,fall+n,cmp); //注意这个排序!
for(i = 0;i<n;i++)
for(j = b;j>=fall[i].c;j--)
if(dp[fall[i].x][j-fall[i].c]>=0)
dp[fall[i].x+fall[i].w][j] = max(dp[fall[i].x+fall[i].w][j],dp[fall[i].x][j-fall[i].c]+fall[i].f);
int ans = -1;
for(i = 0;i<=b;i++)
ans = max(ans,dp[l][i]);
printf("%d/n",ans);
}
return 0;
}
2.BOJ1666博弈搜索。
简单的记忆化搜,过的话没什么悬念。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int x,stand;
int dp[130][130*32];
int search(int n,int k,int most)
{
int i;
if(n==0)return 0;
int p = min(n,most);
if(dp[n][p]>=0)return dp[n][p];
// int p = min(n,most);
for(i = 1;i<=p;i++)
{
if(!search(n-i,k,i*k))
{
dp[n][p] = 1;
if(n==stand)x = i;
return 1;
}
}
dp[n][p] = 0;
return 0;
}
int main()
{
int i,j,n,k;
int cas = 0;
while(scanf("%d%d",&n,&k)!=EOF)
{
stand = n;
memset(dp,-1,sizeof(dp));
if(search(n,k,n-1))printf("Case %d: %d/n",++cas,x);
else printf("Case %d: lose/n",++cas);
}
return 0;
}