具体题目找不到了
有题目的,在下面帮忙留一下图片
装钻石问题 用最少的容器数量 装所有的钻石
每个容器不能超过体积
v = { 5, 1, 2, 3, 4, 5, 6, 7, 8, 9 };每颗钻石的质量
int rongqi = 14; 每个容器允许装的最大重量
答案:
5, 9
6, 8
2, 5, 7
1, 3, 4
用4个袋子装
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// 求排列组合算法: C(n, m): 从n个数中任选m个数组成一个新的数, 求有多少种组合, 分别是什么
// 从v[]里任选m个元素组成一个组合, 与顺序无关
template<class T>
vector<vector<T>> fun(vector<T> v, int m)
{
if (v.size() < m)
return{}; // 找不到这样的组合
vector<vector<T>> ret;
if (v.size() == m) // v[]中任选m个数
{
ret.push_back(v); // 唯一的一个组合
return ret;
}
else if (m == 1) // v[]中任选1个数
{
for (auto& it : v)
{
ret.push_back(vector<T> {it});
}
return ret;
}
while (v.size() >= m)
{
auto first = v.front();
v.erase(v.begin());
// 在剩下的v[1~]中任选m-1个数
auto res = fun(v, m - 1);
for (auto& it : res)
{
it.insert(it.begin(), first);
ret.push_back(it);
}
}
return ret;
}
int main()
{
std::vector<int> v = { 5, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int biaozhiwei = 0;
int number=10;
int rongqi = 14;
//cin >> number;
//v.erase(v.begin(), v.end());
//for (int iii = 1; iii <= number; iii++)
//{
// int temp = 0;
// cin >> temp;
// v.push_back(temp);
//}
// cin >> rongqi;
while (1)
{
biaozhiwei = 0;
for (int i = rongqi; i >= 1; i--)
{
for (int m = 1; m <= v.size(); m++)
{
auto res = fun(v, m);
for (auto& it : res)
{
int sum = 0;
vector<int> sum_ys;
sum_ys.clear();
for (auto& it2 : it)
{
//printf("%d ", it2);
sum_ys.push_back(it2);
sum = sum + it2;
}
//printf("\n");
if (sum == i)
{
cout << ":::::";
for (int ii = 0; ii <= sum_ys.size() - 1; ii++)
{
cout <<" "<< sum_ys[ii] << " ";
vector<int>::iterator result = find(v.begin(), v.end(), sum_ys[ii]); //查找sum_ys[ii]
int a = result[0];
v.erase(find(v.begin(), v.end(), sum_ys[ii]), find(v.begin(), v.end(), sum_ys[ii])+1);
}
biaozhiwei = 1;
break;
printf("\n");
}
}
if (biaozhiwei == 1)
break;
}
if (biaozhiwei == 1)
break;
}
cout << " v: ";
for (int i = 0; i<v.size(); ++i)
{
cout << v[i] << ' ';
}
cout << endl;
if (v.size() == 0)
break;
}
cout << "cccccc" << endl;
return 0;
}