动态规划之流水作业调度

 自己实现的流水作业调度代码，冒泡排序部分写的比较烂，先发上来存一下。

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
void BubbleSort(int n, int sum, int *a, int *b, int *index)//冒泡排序
{
	for (int i = 1; i < n; i++)
	{
		if (i <= sum)
		{
			for (int i = 1; i <= sum; i++)
			{
				for (int j = sum; j>i; j--)
				{
					if (a[j] >= a[j + 1])      //前一半按照a[i]升序排列
					{
						swap(a[j], a[j + 1]);
						swap(b[j], b[j + 1]);
						swap(index[j], index[j + 1]);  //同时处理三个数组
					}
				}
			}
		}
		else
		{
			for (int i = sum + 1; i <= n; i++)
			{
				for (int j = n; j > i; j--)
				{
					if (b[j-1] <= b[j])       //后一半按照b[i]降序排列
					{
						swap(a[j-1], a[j]);
						swap(b[j-1], b[j]);
						swap(index[j-1], index[j]);  //同时处理三个数组
					}
				}
			}
		}

	}
}
int Process(int n, int *a, int *b)
{
	int index[100], min = 1, max = n, sum = 0;  //index数组用来储存当前的调度序号
	for (int i = 1; i <= n; i++)
	{
		if (a[i] < b[i])
		{
			index[min] = i;
			min++;
			sum++;
		}
		else
		{
			index[max] = i;
			max--;
		}
	}
	BubbleSort(n, sum, a, b, index);
	int sum1 = a[1], sum2 = a[1];
	for (int i = 1; i <= n; i++)
	{
		sum1 = sum1 + a[i + 1];
		sum2 = sum2 + b[i];
		if (sum2 < sum1)
			sum2 = sum1;
	}
	return sum2;
}
int main()
{
	int n, a[100], b[100];
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i] >> b[i];
	int end = Process(n, a, b); 
	cout << endl;
	return 0;
}