2020-02-01

求解蓄栏保留问题。农场有n头牛，每头牛会有一个特定的时间区间[b，e]在蓄栏里挤牛奶，并且一个蓄栏里任何时刻只能有一头牛挤奶。

现在农场主希望知道最少蓄栏能够满足上述要求，并给出每头牛被安排的方案。对于多种可行方案，输出一种即可。

#include
#include
#include

using namespace std;

#define MAX 50

int a[MAX][3] = { {999},{1,4},{2,5},{5,7}, {8,9},{4,10},{12,13}, {11,15} }, b[MAX] = { 0 };
int n=7, num = 0, tempt = 0;

void bfs()
{
int min = 99999, pes = -1, second, pos = -1;
for (int i = 1; i <= n; i++)//每一个栅栏寻找出最早可以挤奶的牛
{
if (b[i] == 1) continue;

	if (a[i][0] < min)
	{
		min = a[i][0];
		pes = i;
	}
}

b[pes] = 1;
tempt++;
cout << pes << " ";

for (int i = 1; i <= n; i++)//寻找可以放在同一栅栏的牛
{
	if (b[i] == 1) continue;

	if (a[pes][1] <= a[i][0])
	{
		second = a[i][0];
		pos = i;
		for (int j = i + 1; j <= n; j++)
		{
			if (b[j] == 1) continue;
			if ((a[pes][1] < a[j][0]) && (a[j][0] < second))
			{
				second = a[j][0];
				pos = j;
			}
		}
		b[pos] = 1;
		tempt++;
		cout << pos << "  ";
		pes = pos;
	}
}

num++;
cout << "tempt = " << tempt << " ";
cout<<endl << "======================" << endl;
if (tempt < n) bfs();

}

int main()
{
bfs();

cout << num << endl;

return 0;

}