[算法设计]贪心法实例——任务安排问题(Java实现)

package selecter;

import java.util.Arrays;

public class ActivitySelecter {
    
    public static final int N = 10;
    static int[] S = new int[] {1, 3, 0, 5, 3, 5, 6, 8, 8, 2, 12};
    static int[] F = new int[] {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14};

    public static void Selecter(int st,int fi,int []a) {
        
        int p = 1;
        int i = st;
        a[0] = i;
        
        for(int j=i+1;j<=fi;j++) {
            if(S[j]>=F[i]) {
                a[p]=j;
                p++;
                i=j;
            }
        }
    }

    public static void main(String[] arges) {
        //测试函数
        int []a = new int [N];
        Selecter(0,N,a);
        System.out.println(Arrays.toString(a));
    }
}