九度中1358:陈博的平均主义http://ac.jobdu.com/problem.php?pid=1358
1420:Jobdu MM分水果http://ac.jobdu.com/problem.php?pid=1420
1462:两船载物问题http://ac.jobdu.com/problem.php?pid=1462
都是我称之为“分两份”的问题,由于要分的两份的总和一般是已知的,所以求出其中一份,另一份就也求出了,这样就可以把分两份的问题转化为只求一份的简单动态规划背包问题。三题的代码如下:
1358:
#include <stdio.h>
bool isAr(int x)
{
int digit[10],size=0,sum=0;
while (x!=0)
{
digit[size]=x%10;
x/=10;
sum+=digit[size++];
}
if (sum&1==1) return false;
int bound=sum/2;
int dp[50]={0};
dp[0]=1;
for (int i=0;i<size;++i)
{
for (int j=bound;j>=digit[i];--j)
{
if (dp[j-digit[i]]==1)
dp[j]=1;
}
}
if (dp[bound]==1) return true;
else return false;
}
int main()
{
int a,b;
while (scanf("%d %d",&a,&b)==2)
{
long long ans=0;
for (int i=a;i<=b;++i)
{
if (isAr(i))
++ans;
}
printf("%lld\n",ans);
}
return 0;
}
1420:
#include <stdio.h>
int a[101];
int dp[5000000];
int main()
{
int n;
while (scanf("%d",&n)!=EOF)
{
int sum=0;
for (int i=0;i<n;++i)
{
scanf("%d",&a[i]);
sum+=a[i];
}
int bound=sum/2;
dp[0]=1;
for (int i=1;i<=bound;++i)
dp[i]=0;
for (int i=0;i<n;++i)
{
for (int j=bound;j>=a[i];--j)
if (dp[j-a[i]]==1)
dp[j]=1;
}
int min;
for (int i=bound;i>=0;--i)
if (dp[i]==1)
{
min=i;break;
}
int ans=sum-min*2;
printf("%d\n",ans);
}
return 0;
}
1462:
#include <stdio.h>
#include <memory.h>
int a[101];
int main()
{
freopen("input.txt","r",stdin);
int n,c1,c2;
while (scanf("%d %d %d",&n,&c1,&c2)!=EOF)
{
int sum=0;
for (int i=0;i<n;++i)
{
scanf("%d",&a[i]);
sum+=a[i];
}
if (sum>c1+c2)
{
printf("NO\n");continue;
}
int dp[c1+c2+1];
memset(dp,0,sizeof dp);
dp[0]=1;
for (int i=0;i<n;++i)
{
for (int j=c1;j>=a[i];--j)
if (dp[j-a[i]]==1)
dp[j]=1;
}
int c1max=0;
for (int i=c1;i>=0;--i)
if (dp[i]==1)
{
c1max=i;break;
}
if (sum-c1max<=c2)
printf("YES\n");
else printf("NO\n");
}
return 0;
}