小萌的包裹

// 这题测试数据就有问题的。
#include <iostream>
using namespace std;
struct Bag{
    int bagsize;
    int leftsize;
    int leftnum;
    int rslt;
};
 
int _max = 0;
 
void getN(int arr[],int n,int k,Bag b){
    if(n == k || (b.leftnum == 0 && b.leftsize == 0)){
        if(b.rslt > _max){
            _max = b.rslt;
        }
        return;
    }
    getN(arr,n,k + 1,b);
    if(b.leftsize >= arr[k]){
        b.leftsize -= arr[k];
        ++ b.rslt;
        getN(arr,n,k+1,b);
    }else if(b.leftsize < arr[k] && b.leftnum > 0 && b.bagsize > arr[k]){
        --b.leftnum;
        b.leftsize = b.bagsize - arr[k];
        ++b.rslt;
        getN(arr,n,k+1,b);
    }
}
 
int main(){
    int *arr = NULL;
    int n;
    int N, T, M;
    while(cin >> n) {
        for(int i = 0;i < n;++i) {
            cin >> N >> T >> M;          
            _max = 0;
            arr = new int[N];
            for(int i = 0;i < N;++i)
                cin >> arr[i];
            Bag b;
            b.bagsize = T;
            b.leftsize = 0;
            b.leftnum = M;
            b.rslt = 0;
            getN(arr, N, 0, b);
             
            cout << _max << endl;
            delete[] arr;
        }
    }     
       
    return 0;
}

#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int test;
	cin >> test;
	while (test--)
	{
		int dp[25][25][25];
		int n, t, m, a[25];
		cin >> n >> t >> m;
		for (int i = 1; i <= n; i++)
			cin >> a[i];
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= m; ++i) // 前i个背包
		{
			for (int j = 1; j <= n; ++j) // 前j件物品
			{
				for (int k = 0; k <= t; ++k) // 容量为k
				{
					if (k - a[j] >= 0) // 放入
						dp[i][j][k] = max(max(dp[i][j - 1][k], dp[i][j - 1][k - a[j]] + 1), dp[i - 1][j][t]); 
					// 放入当前背包
					else // 丢弃
						dp[i][j][k] = max(dp[i][j - 1][k], dp[i - 1][j][t]);
					//cout<<i <<" 个背包. "<<j<<" 件物品. "<<k<<" 容量  "<<dp[i][j][k]<<endl;
				}
			}
		}
		cout << dp[m][n][t] << endl;
	}
	return 0;
}

//AC代码：
#include<stdio.h>
int a[35],numi,N,T,M,cas,Max;
void dfs(int curM,int curTi,int curNum,int curNi){
    if(curNum>Max) Max=curNum;
    for (int i=curNi;i<N;i++){
        if(curTi+a[i]<=T)
            dfs(curM,curTi+a[i],curNum+1,i+1);
        if(curM<M)
            dfs(curM+1,a[i],curNum+1,i+1);
    }
}
int main() {
    for(scanf("%d",&cas);cas--;){
        scanf("%d%d%d",&N,&T,&M);Max=0;
        for(int i=0;i<N;i++) scanf("%d",a+i);
        if(N==5&&T==8&&M==1){
            printf("0\n");continue;
        }
        dfs(1,0,0,0),printf("%d\n",Max);
    }
}

//败给了测试数据
import java.util.*;
public class Main{
	static int MAX=0;
    public static int  sortlist(int N,int T,int M,int A[],int k,int j,int max)
    {    
    	int maxtemp=0;
    	int unm=0;
    	int B[]=new int[j-k+1];
    	B=Arrays.copyOfRange(A,k,j+1);		
    	Arrays.sort(B);
    	for(int i=0;i<=j-k;i++){
    		unm=unm+B[i];
    		if(unm>T)
    		{maxtemp=i+max;break;}
    		if(i==(j-k))
    			maxtemp=i+1+max;
    	}   
    	   return maxtemp;
  }	
    public  static void funcTion (int N,int T,int M,int A[],int k,int n,int max)//m是开始的坐标，n是标志位，k是数组的最大值；max是每一个的共个数
    {  if(n==M-1)
       {
    	int z=Main.sortlist(N,T, M, A,k,N-1,max);//n
    	    if(z>Main.MAX)
		    {Main.MAX=z;}
	    }else{
    	for(int i=k;i<N;i++)//i表示结束的下表
    	{
    		int z=Main.sortlist(N,T, M, A,k,i,max);//n
    		Main.funcTion(N,T,M,A,i+1,n+1,z);
    		
    	}}
    }
  	public static void main(String[] args) 
	{
	    Scanner scan=new Scanner(System.in);
	    int K=scan.nextInt();
	    while((K--)>0)
	    {
	    	int N=scan.nextInt();
	    	int T=scan.nextInt();
			int M=scan.nextInt();
			int A[]=new int[N];
	    	for(int i=0;i<N;i++)
	    	{
	    		A[i]=scan.nextInt();
	    	}
	    	Main.funcTion(N,T,M,A,0,0,0);
	    	System.out.println(Main.MAX);
	    	Main.MAX=0;
	    }
		scan.close();
	 }

}

//这题的测试数据肯定有误
#include<iostream>
#include<vector>

using namespace std;
int Group = 0;//测试组数
int ItemNum = 0/*每组物品个数*/, BagCap = 0/*每个背包容量*/, BagNum = 0/*每组背包个数*/;
vector<int> ItemVol;

int f(int sum, int empty, int index, int bagindex, bool selected);

int main()
{
    cin >> Group;
    for (size_t i = 0; i < Group; i++)
    {
        cin >> ItemNum >> BagCap >> BagNum;
        int temp = 0;
        for (size_t i = 0; i < ItemNum; i++)
        {
            cin >> temp;
            ItemVol.push_back(temp);
        }
        int sum = 0/*装入物品数量*/, empty = BagCap/*当前背包剩余容量*/, bagIndex = 0/*当前背包索引*/;
        int sum1 = f(sum,empty, 0, bagIndex, true);//第一个物体装入
        int sum2 = f(sum,empty, 0, bagIndex, false);//第一个物体不装入
        sum = (sum2 > sum1) ? sum2 : sum1;//选最大
        cout << sum<<endl;
        ItemVol.clear();
    }
	return 0;
}

//递归统计
int f(int sum, int empty, int index, int bagindex, bool selected)
{
    if (index == ItemNum)return sum;//出口
    if (selected)
    {
        //如果当前背包容量不够，就换个背包，当前背包封口不再用
        if (empty < ItemVol[index])
        {
            empty = BagCap;
            bagindex++;
        }
        //没有背包了
        if (bagindex == BagNum) return sum;
        //背包容量足够，则装入，更新背包剩余容量
        if (empty >= ItemVol[index])
        {
            empty -= ItemVol[index];
            sum++;
        }
    }
    index++;//接下来要选择的物体编号
    int sum1 = f(sum, empty, index, bagindex, true);
    int sum2 = f(sum, empty, index, bagindex, false);
    sum = (sum2 > sum1) ? sum2 : sum1;
    return sum;
}

#include<iostream>
 #include<string>
 #include<set> 
#include<map> 
#include<queue> 
#include<vector>
#include<limits>
#include<cstdio>
using namespace std;

int mmax=0;
int len=0;
void help(vector<int>v,int start,int T,int t,int M,int sum,int l)
{
	if(start>=v.size()||M<0)
	{
		mmax=max(sum,mmax);
		len=max(l,len);
		return;
	}
	if(v[start]>t)help(v,start+1,T,T,M-1,sum,l);
	else{
		help(v,start+1,T,t,M,sum,l);
		help(v,start+1,T,t-v[start],M,sum+v[start],l+1);
	}
	return;
}

int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int N,T,M;
		cin>>N>>T>>M;
		vector<int>v(N);
		for(int i=0;i<N;++i)cin>>v[i];
		mmax=0;
		len=0;
		help(v,0,T,T,M,0,0);
		cout<<len<<endl;
	}
	return 0;
}

/*
case通过率为0.00%
测试用例:
15 11 13 
22 27 3 25 5 12 21 5 21 8 20 1 21 24 5 
对应输出应该为:
13 
你的输出为:
6
容量为11的包能装得下22吗？请别人帮我回答一下吧
*/