UVa Problem 102 - Ecological Bin Packing-优快云博客

此博客介绍了UVaProblem102的解决方案，通过穷举法解决生态瓶装排列问题，旨在最小化移动次数。具体包括算法实现、变量定义和输入输出流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// UVa Problem 102 - Ecological Bin Packing // Verdict: Accepted // Submission Date: 2011-10-16 // UVa Run Time: 0.164s // // 版权所有（C）2011，邱秋。metaphysis # yeah dot net // // [解题方法] // 三种颜色的排列只有六种可能，直接使用穷举法即可。 #include <iostream> #include <sstream> using namespace std; #define MAXN 3 #define MAXTYPES 6 int bottles[MAXN][MAXN], total; string sequences[MAXTYPES] = { "132", "123", "312", "321", "213", "231" }; string bins[MAXTYPES] = { "BCG", "BGC", "CBG", "CGB", "GBC", "GCB" }; int move(string sequence) { int movements = total; for (int i = 0; i < sequence.length(); i++) for (int j = 0; j < MAXN; j++) if (j == i) movements -= bottles[j][sequence[i] - '1']; return movements; } int main(int ac, char *av[]) { string line; while (getline(cin, line)) { istringstream iss(line); total = 0; for (int i = 0; i < MAXN; i++) for (int j = 0; j < MAXN; j++) { iss >> bottles[i][j]; total += bottles[i][j]; } int minimum = total, marker; for (int i = 0; i < MAXTYPES; i++) { int movements = move(sequences[i]); if (minimum > movements) { minimum = movements; marker = i; } } cout << bins[marker] << " " << minimum << endl; } return 0; }