活动安排问题.cpp

#include<bits/stdc++.h>
using namespace std;
const int n = 11;
int ActiveManage(int s[ ], int f[ ], int B[ ], int n);

int main( )
{
    int s[n] = {1,3,0,5,3,5,6,8,8,2,12};
    int f[n] = {4,5,6,7,8,9,10,11,12,13,14};
    int B[n] = {0};
    int k = ActiveManage(s, f, B, n);
    cout<<"最多可安排的活动个数是："<<k<<endl;
    cout<<"具体的活动是：";
    for (int i = 0; i < n; i++)
        if (B[i] == 1)
            cout<<"活动"<<i<<"  ";
    cout<<endl;
    return 0;

}

int ActiveManage(int s[ ], int f[ ], int B[ ], int n)
{
    int i, j, count;
    B[0] = 1;
    j = 1;
    count = 1;
    for (i = 1; i < n; i++)                    //依次考察每一个活动
    {
        if (s[i] >= f[j])               //活动i与集合B中最后结束的活动j相容
        {
            B[i] = 1;
            j = i;
            count++;
        }
        else
            B[i] = 0;
    }
    return count;                          //返回已安排的活动个数
}