贪心算法-活动安排

//《算法》P103
 1 template <typename Type>
void greedySelector(int n, Type s[], Type f[], bool A[])
{
    A[1] = true;
    int j = 1;
    for(int i = 2; i <= n; ++ i){
        if(f[j] <= s[i]){
            A[i] = true;
            j = i;
        }
        else
            A[i] = false;
    }
}