UVa Problem 102 - Ecological Bin Packing

最新推荐文章于 2018-08-21 10:27:14 发布

原创最新推荐文章于 2018-08-21 10:27:14 发布 · 928 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string #date #c

入门专栏收录该内容

18 篇文章

订阅专栏

此博客解决UVa Online Judge上的问题102：生态箱打包，采用穷举法解决三种颜色排列下的最小移动次数问题。

摘要生成于 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;
}