NYIST 654喜欢玩warcraft的ltl

该题就是01背包问题，一个常数优化，详细讲解见背包问题九讲

就是优化他的循环次数

不然会超时的

#include <stdio.h>
#include <string.h>

#define N 1000

int f[N*1003];
int c[N];
int w[N];

int max(int n,int x)
{
    return n > x?n:x;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        int i = 0;
        memset(c,0,sizeof(c));
        memset(w,0,sizeof(w));

        for(i = 1; i <= n; i++)
            scanf("%d%d",&c[i],&w[i]);
        int j = 0;
        memset(f,0,sizeof(f));

        int k = 0;

        for(i = 1; i <= n; i++){
            int sum = 0;
            for(k = i; k <= n; k++)
             sum +=c[k];
            int d = max(m - sum,c[i]);
        for(j = m; j >= d; j--)
            if(f[j- c[i]] + w[i] > f[j])
                f[j] = f[j-c[i]] + w[i];
        }
        printf("Max experience: %d\n",f[m]);
    }
    return 0;
}