思路: 这题就是dfs判断,然后二分 dfs加个剪枝 C o d e Code Code: #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define N 1055 using namespace std; int n,m,c[N]; int b[N],a[N],sum[N],tot; bool dfs(int k,int waste,int wz,int mid)//判断 { if(k <