//递归贪心算法的实现
//test1.cpp
#include <iostream>
using namespace std;
void RecursiveActivitySeletor(int* s,int *f,int i,const int n)
{
int m=i+1;
while(m<=n&&s[m]<f[i])
m+=1;
if (m<=n)
{
cout<<"a["<<m<<"]"<<" ";
RecursiveActivitySeletor(s,f,m,n);
}
}
int main()
{
int i,n=11;
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};
RecursiveActivitySeletor(s,f,0,n);
cout<<endl;
return 0;
}
递归贪心算法c++源码实现
最新推荐文章于 2024-08-20 19:48:58 发布