迭代贪心算法c++源码实现

//迭代贪心算法的实现
//test2.cpp
#include <iostream>
using namespace std;

int i=0,n=11,k=0;
int b[10];

void GreedyActivitySeletor(int* s,int *f)
{	
	for(int m=i+1;m<=n;m++)
		if (s[m]>=f[i])
		{
			k++;
			b[k]=m;//b[k]中存放满足条件的活动m
			i=m;
		}
}

int main()
{
	//static int i,n=11,k=1;
	int s[]={0,1,3,0,5,3,5,6,8,8,2,12};
	int f[]={0,4,5,6,7,8,9,10,11,12,13,14};

	GreedyActivitySeletor(s,f);

	for(int j=1;j<=k;j++)
		cout<<"a["<<b[j]<<"]"<<"  ";
	cout<<endl;

	return 0;
}