Hdu 2546 meal card (DP)

I had this question a long time ago and couldn't sleep at night. When I saw nyist playing a DP game, I came in and made a soy sauce.

The best touch of this question is to record the maximum value and change it to 0. Then it is a normal backpack.

 

#include<stdio.h>#include<string.h>#define N 1005int Max(int x,int y){    if(x>y)        return x;    else        return y;}int main(){    int n;    int a[N],mark[N];    while(scanf("%d",&n),n)    {        int max,flag;        int i,j;        flag=-1;        max=0;        int sum=0;        for(i=0;i<n;i++)        {            scanf("%d",&a[i]);            sum+=a[i];            if(a[i]>max)            {                max=a[i];                flag=i;            }        }        int v;        scanf("%d",&v);        if(v<5)        {            printf("%d\n",v);            continue;        }        if(v-sum>=5)        {            printf("%d\n",v-sum);            continue;        }        a[flag]=0;        v-=5;        memset(mark,0,sizeof(mark));        for(i=0;i<n;i++)        {            for(j=v;j>=a[i];j--)                mark[j]=Max(mark[j],mark[j-a[i]]+a[i]);        }        v=v+5-mark[v]-max;        printf("%d\n",v);    }    return 0;}