zoukankan      html  css  js  c++  java
  • HDU5240——贪心——Exam

    Problem Description
    As this term is going to end, DRD needs to prepare for his final exams.

    DRD has n exams. They are all hard, but their difficulties are different. DRD will spend at least ri hours on the i-th course before its exam starts, or he will fail it. The i-th course's exam will take place ei hours later from now, and it will last for li hours. When DRD takes an exam, he must devote himself to this exam and cannot (p)review any courses. Note that DRD can review for discontinuous time. 

    So he wonder whether he can pass all of his courses. 

    No two exams will collide. 
     
    Input
    First line: an positive integer T20 indicating the number of test cases.
    There are T cases following. In each case, the first line contains an positive integer n105, and n lines follow. In each of these lines, there are 3 integers ri,ei,li, where 0ri,ei,li109

     
    Output
    For each test case: output ''Case #x: ans'' (without quotes), where x is the number of test cases, and ans is ''YES'' (without quotes) if DRD can pass all the courses, and otherwise ''NO'' (without quotes). 

     
    Sample Input
    2 3 3 2 2 5 100 2 7 1000 2 3 3 10 2 5 100 2 7 1000 2
     
    Sample Output
    Case #1: NO Case #2: YES
     
    Source
     
    Recommend
    We have carefully selected several similar problems for you:  5245 5244 5243 5242 5241 
     大意:很水的一道贪心题目,排个序,只是在那道将军士兵基础上把输出最短路改成判断而已。。。上海比赛的时候我竟然1个小时了才做出,,,毕竟第一次参赛手抖不是...
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int inf = 0x3f3f3f3f;
    struct edge{
        int r,e,l;
    }t[100010];
    bool cmp(edge i,edge j)
    {
        return i.e < j.e;
    }
    int main()
    {
        int T,n,r,e,l;
        bool flag;
        scanf("%d",&T);
        for(int cas = 1; cas <= T;cas++){
            scanf("%d",&n);
            for(int i = 1; i <= n ;i++){
                scanf("%d%d%d",&t[i].r,&t[i].e,&t[i].l);
            }
            sort(t+1,t+n+1,cmp);
            int max1 = 0,max2 = inf;
            int m = 0;
             flag = false ;
            for(int i = 1; i <= n; i++){
                if(i == 1)
                m = t[i].r;
                else 
                m = max2 + t[i].r;
                if(m > t[i].e){
                    flag = true;
                    break;
                }
                max1 += t[i].r;
                max2 = min(max1+t[i].l,max2);
            }
        printf("Case #%d: ",cas);
        if(flag == false)
            printf("YES
    ");
        else printf("NO
    ");
        }
        return 0;
    }
                
    

      

  • 相关阅读:
    适用于ASP.NET的留言本(翻译)
    大足石刻一日游
    Zonet 宽带路由器eMule端口映射设置
    在公式编辑器中使用键盘
    TAU G2的错误信息:TSC0134: Transition must end with stop, nextstate or join action
    Sony DV的CCD也是有问题的
    使用UltraEdit实现从UNIX文件到DOS文件的批量转换
    在PowerPoint中改变公式编辑器的颜色
    如何在Visual Studio.NET 2003下编译ANTLR 2.77
    如何修复修复损坏的TAU G2的.u2文件
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4532182.html
Copyright © 2011-2022 走看看