8.6贪心策略例题：区间覆盖问题

/**
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn.
He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000),
the first being shift 1 and the last being shift T.
Each cow is only available at some interval of times during the day for work on cleaning.
Any cow that is selected for cleaning duty will work for the entirety of her interval.
Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it,
and (ii) as few cows as possible are involved in cleaning. If it is not possible to assign a cow to each shift, print -1.

Input
Line 1: Two space-separated integers: N and T
Lines 2..N+1: Each line contains the start and end times of the interval during which a cow can work.
A cow starts work at the start time and finishes after the end time.

Output
Line 1: The minimum number of cows Farmer John needs to hire or -1 if it is not possible to assign a cow to each shift.

Sample Input
3 10
1 7
3 6
6 10
Sample Output
2

*/
//POJ2376

找每一个子问题的最优解

import java.util.Arrays;
import java.util.Scanner;

public class Eight_6贪心策略例题_区间覆盖问题 {
    private static class Job implements Comparable<Job> {
        int s;
        int t;

        public Job(int s, int t) {
            super();
            this.s = s;
            this.t = t;
        }

        @Override
        public int compareTo(Job Other) {
            int x = this.s-Other.s;
            if(x == 0)
                return this.t-Other.t;
            else
                return x;
        }

        @Override
        public String toString() {
            return "Job [s=" + s + ", t=" + t + "]";
        }    
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        int T = in.nextInt();
        Job[] jobs = new Job[N];
        for(int i = 0; i < N; i++){
            jobs[i] = new Job(in.nextInt(), in.nextInt());
        }
        
        Arrays.sort(jobs);
        int start = 1; //要覆盖的目标点，end覆盖该点的所有区间中右端点最右
        int end = 1;
        int ans = 1;
        for(int i = 0; i < T; i++){
            int s = jobs[i].s;
            int t = jobs[i].t;
            
            if(i == 0 && s > 1)
                break;
            if(s <= start){
                end = Math.max(t, end);
            }else{ //开始下一个区间
                ans++;
                start = end+1; //更新起点
                if(s <= start){
                    end = Math.max(t, end);
                }else{
                    break;
                }
            }
            if(end >= T) //区间右端点大于输入段退出循环
                break;
        }
        
        if(end < T)
            System.out.println("-1");
        else
            System.out.println(ans);
    }
}