算法导论贪心算法活动选择

#include<iostream>
using namespace std;


void Init(int *s,int *f,int n){
	for(int i=0;i<n;i++){
		cin>>s[i]>>f[i];
	}
}

//递归算法 
void RECURSIVE_ACTIVITY_SELECTOR(int *s,int *f,int k,int n){
	int m=k;
	while(m<=n && s[m]<f[k]){
		m+=1;
	}
	
	if(m<=n){
		cout<<m+1<<" ";
		RECURSIVE_ACTIVITY_SELECTOR(s,f,m,n);
	}
}


//迭代算法
void GREEDY_ACTIVITY_SELECTOR(int *s,int *f,int n){
	cout<<1<<" ";
	int k=0;
	for(int m=1;m<=n;m++){
		if(s[m]>=f[k]){
			cout<<m+1<<" ";
			k=m;
		}
	}
} 

int main(){

	int n;
	int s[100],f[100];
	cin>>n;
	Init(s,f,n);
	//递归 
	//cout<<1<<" ";
	//RECURSIVE_ACTIVITY_SELECTOR(s,f,0,n-1);
	//迭代 
	GREEDY_ACTIVITY_SELECTOR(s,f,n-1);
	return 0;
}

/*

11
1 4
3 5
0 6
5 7
3 9
5 9
6 10
8 11
8 12
2 14
12 16

*/