zoukankan      html  css  js  c++  java
  • 杭电 1150 moving tables

    http://acm.hdu.edu.cn/showproblem.php?

    pid=1050

    Moving Tables

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 18850    Accepted Submission(s): 6440


    Problem Description
    The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.



    The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving.



    For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager’s problem.
     

    Input
    The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
     

    Output
    The output should contain the minimum time in minutes to complete the moving, one per line.
     

    Sample Input
    3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
     

    Sample Output
    10 20 30
     

    简单贪心题,找重叠次数最多的部分。
    AC代码:
    <span style="font-size:18px;">#include<stdio.h>
    #include<string.h>
    int a[201];
    int main()
    {    
      int n,b,i,m,p,q,t,j,k;
      scanf("%d",&n);
      for(t=0;t<n;t++)
      {
       memset(a,0,sizeof(a));
       scanf("%d",&b);
       for(i=1;i<=b;i++)
       {
       scanf("%d %d",&p,&q);
       p=(p-1)/2;//缩小
       q=(q-1)/2;
        if(p>q)//确保q大于p
        {
            m=p;
            p=q;
            q=m;
        }
        for(j=p;j<=q;j++)
            a[j]++;  //标记
       }
       k=1;
       for(j=0;j<200;j++)
           if(a[j]>k)//重叠次数最多的
               k=a[j];
           printf("%d
    ",k*10);
      }
     
      return 0;
    }</span>


  • 相关阅读:
    vs项目属性中的包含目录和库目录以及附加依赖项全都配置正确了,却还是提示:无法解析的外部符号
    开发六年mybatisplus使用小结
    去“BAT”这样面试,拿到offer的几率是80%
    阿里P7级教你如何在Spring Boot应用程序中使用Redis
    为什么Java大数据能带你走上人生巅峰
    惊呆!Java程序员等级一览
    不要做一个只会面向搜索编程的程序员
    三年总结出来的11个JPA和Hibernate查询配置小技巧
    阿里高级架构师教你使用Spring JMS处理消息事务源码案例
    阿里高级架构师教你使用Spring Cloud Sleuth跟踪微服务
  • 原文地址:https://www.cnblogs.com/blfbuaa/p/6845126.html
Copyright © 2011-2022 走看看