【POJ 3093 Margaritas on the River Walk 】01背包

POJ 3093
题意
就是问这几个东西凑起来 不能剩空间买其他东西 又组合起来的代价小于V
我们可以排个序 枚举第 i 个作为剩下的的物品中最小的东西 那么前面 i - 1 都是已经在背包里的
那么就是枚举 i = 1 的时候 统计一个 [2,n]的背包
枚举 i = 2 的时候 统计一个 [3,n]的背包
…
这样复杂度是 O(nnm)
如何降复杂度呢
我们发现 如果你反过来dp
那么就是枚举 i = n-1 的时候 统计一个 [n,n]的背包
枚举 i = n-2 的时候 统计一个 [n-1,n]的背包
…
这样我们不就是可以背包了么
然后就可以输出答案了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 1025;
int v[MAX_N],dp[MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t,n,m,Case = 0;
    scanf("%d",&t);
    while(t--)
    {
        long long ans = 0,sum = 0;
        scanf("%d%d",&n,&m);
        for(int i = 1;i<=n;++i) scanf("%d",&v[i]),sum+=v[i];
        memset(dp,0,sizeof(dp));dp[0] = 1;
        sort(v+1,v+1+n);
        for(int i = n;i>=1;--i)
        {
            sum-=v[i];if(v[i]>m) continue;
            for(int j = 0;j<v[i]&&m-sum-j>=0;++j)
                ans+=dp[m-sum-j];
            for(int j = m;j>=v[i];--j)
                dp[j] += dp[j-v[i]] ;
        }
        printf("%d %lld\n",++Case,ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}