闭区间覆盖问题，是用贪心实现的！程序很简洁啊！-closed interval coverage is used to achieve the greedy! Very simple procedures ah!

区间覆盖问题的算法实现 问题描述：给出x轴上N条线段的坐标，从中选出一些线段来覆盖区间【0，M】，要求所用线段数目最少 -Interval coverage of the realization of the algorithm descr iption: In this paper, x-axis N be the coordinates of line segment, selected to cover a number of line segments [interval 0,

设x1，x2，…xn是实直线上的n个点。用固定长度为k的闭区间覆盖这n个点，至少需要多少个这样的固定长度闭区间？设计此问题的有效算法。 -Set x1, x2, ... xn is a real line on the n points. Fixed length k, closed interval covering the n points, at least the number of such fixed-length closed interval? Design an effec

算法设计课本的第四章区间覆盖问题作业题的实现(Operation problem of interval coverage problem in fourth chapters of algorithm design)

算法设计课本第四章的区间覆盖问题的学习与实现文档(The learning and implementation documents of the interval coverage problem in fourth chapters of the algorithm design textbook)