算法设计与分析--活动安排问题(贪心算法）

public class GreedySeletor {

	
	public static int greedySelector(int []s,int []f,boolean []a) {
		int n=s.length-1 ;
		a[1]=true;
	    int  j=1;
	    int count=1;
	    for(int i=2;i<=n;i++) {
	    	if(s[i]>=f[j]) {
	    		a[i]=true;
	    		j=i;
	    		count++;
	    		
	    		
	    	}
	    	else {
	       a[i]=false;
	    	}
	    }
	    return count;
	}
	
	public static void main(String[] args) {
		
		    int[] s = { 1, 3, 0, 5 };
	        int[] f = { 4, 5, 6, 7};
	       
	        boolean[] a = new boolean[s.length];

	        int result = greedySelector(s, f, a);
	        System.out.println("结果是: " + result);
	        for (int i = 1; i <= s.length-1 ; i++) {
	            if (a[i]) {
	            	int t=i+1;
	                System.out.println("第" + t + "活动被选中，其开始时间为：" + s[i] + "，结束时间为：" + f[i]);
	            }
	        }
	    }

	}