贪心算法 区域覆盖

转载自：https://blog.csdn.net/cordova/article/details/50853147

解法分析：
先用一条最长的线段把整个区间覆盖起来，然后把区间点之间的空隔线段按照先长后短的顺序一一去掉，也就是贪心地使总线段长度尽可能短，直到线段的数量增加到到规定的数目停止；

源码：

#include <iostream>
#include <algorithm>
using namespace std;

int descend(int a,int b)
{
    return a>b;
}
int main(){
    int n,m,minLength;
    int point[200],distance[200];
    cout << "input point num and seg num:";
    cin >> n >> m;
    cout << "input point:";
    for(int i=0; i<n; i++){
        cin >> point[i];
    }
    sort(point,point+n);
    minLength = point[n-1]-point[0] + 1;
    for(int i=0; i<n; i++){
        distance[i] = point[i+1]-point[i]-1;
    }
    int distenceLen = n-1;
    sort(distance,distance+distenceLen,descend);
    for(int i=0; i<n-m; i++){
        minLength -= distance[i];
    }
    cout << "minLenth=" << minLength << endl;
    return 0;
}