Minimal coverage UVA 10020

最新推荐文章于 2021-10-01 16:12:28 发布

原创最新推荐文章于 2021-10-01 16:12:28 发布 · 535 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

贪心算法专栏收录该内容

2 篇文章

订阅专栏

本文探讨使用贪心算法解决区间覆盖问题，通过最小化选取的线段数量来完全覆盖给定范围。包括输入输出格式说明、示例输入输出及代码实现分析，特别指出C++与C输入输出效率差异。

贪心算法<区间覆盖问题>

Minimal coverage

The Problem

Given several segments of line (int the X axis) with coordinates [L_i,R_i]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M].

The Input

The first line is the number of test cases, followed by a blank line.

Each test case in the input should contains an integer M(1<=M<=5000), followed by pairs "L_i R_i"(|L_i|, |R_i|<=50000, i<=100000), each on a separate line. Each test case of input is terminated by pair "0 0".

Each test case will be separated by a single line.

The Output

For each test case, in the first line of output your programm should print the minimal number of line segments which can cover segment [0,M]. In the following lines, the coordinates of segments, sorted by their left end (L_i), should be printed in the same format as in the input. Pair "0 0" should not be printed. If [0,M] can not be covered by given line segments, your programm should print "0"(without quotes).

Print a blank line between the outputs for two consecutive test cases.

Sample Input

Sample Output

题解：

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define MAXN 100010
struct line{
    int l;
    int r;
}a[MAXN],res[MAXN];
int n,m,num;
void init(){
//    memset(a,0,sizeof(a));
//    memset(res,0,sizeof(res));
//    cin>>m;
    scanf("%d",&m);
    for(num=0;1;num++){
//        cin>>a[num].l>>a[num].r;
        scanf("%d%d",&a[num].l,&a[num].r);
        if(!a[num].l&&!a[num].r) break;
    }
}
bool cmp(const line &e1,const line &e2){
    if(e1.l==e2.l){
        return e1.r>e2.r;
    }else{
        return e1.l<e2.l;
    }
}
void solve(){
    int tot;
    int flag;
    int left,cMax;
    int pos;
    tot=0;
    left=cMax=0;
    sort(a,a+num,cmp);
    while(1){
        flag=0;
        for(int i=0;i<num;i++){
            if(a[i].l<=left){
                if(a[i].r>cMax){
                    flag=1;
                    pos=i;
                    cMax=a[i].r;
                }
            }
        }
        if(flag){
            res[tot++]=a[pos];
            left=a[pos].r;
            if(left>=m) break;
        }else break;
    }
    if(flag){
//        cout<<tot<<endl;
        printf("%d\n",tot);
        for(int i=0;i<tot;i++){
//            cout<<res[i].l<<" "<<res[i].r<<endl;
            printf("%d %d\n",res[i].l,res[i].r);
        }
    }else{
//        cout<<"0"<<endl;
        printf("0\n");
    }
}
int main(){
//    cin>>n;
    scanf("%d",&n);
    while(n--){
        init();
        solve();
//        if(n) cout<<endl;
        if(n) printf("\n");
    }
    return 0;
}

发现了一个很有意思的事情，把c++版的输入输出 cin,cout换成c版的scanf,printf 执行时间由 188ms 减少到了 115ms，看来c++的输入输出时间要比c的输入输出慢很多。