hdu1050

Moving Tables

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

题目链接：acm.hdu.edu.cn/showproblem.php?pid=1050

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

102030解题思路：    题目大意就是在一个狭长的走廊里搬桌子，每次把桌子从一个房间搬到另一个房间，要求每次路径不能重叠（可以同时搬路径不重叠的桌子），问至少需要多少时间能够搬完。    贪心区间覆盖问题，算出每一段走廊走的次数，然后取最大值，因为每次搬消耗10分钟，所以最大值*10即为所求。完整代码：
#include <iostream>//数据输入输出流#include <string.h>//字符串操作函数#include <stdio.h>//C的输入输出#include <stdlib.h>//定义杂项函数及内存分配函数#include <math.h>//C中的数学函数#include <string.h>//c++中的string类 他不能用strcpy等c函数去操作#include <vector>//STL vetor容器#include <list>//STL list#include <map>// STL map#include <queue>// STL queue#include <stack>//sTL stack#include <bitset>//bitset可按位定义串//比如：bitset <1000> all;定义一个1000位的串#include <algorithm>//STL各种算法 比如 swap sort merge max min 比较#include <numeric>//常用数字操作 一般和algorithm搭配使用#include <functional>//STL定义运算函数（代替运算符）#include <limits.h>//定义各种数据类型最值常量using namespace std;int a[1000001];int main(){    #ifndef ONLINE_JUDGE    freopen("in.txt","r",stdin);    #endif    int T;    scanf("%d",&T);    while(T--)    {    memset(a , 0 , sizeof(a));    int n;    scanf("%d",&n);    while(n--)    {    int s , t;    scanf("%d%d",&s,&t);    s = (s - 1) / 2;    t = (t - 1) / 2;    int k;    if(s > t)    {    k = s;    s = t;    t = k;    }     for(int i = s ; i <= t ; i ++)    a[i] ++;    }    int maxx = -999999;    for(int i = 1; i <= 200 ; i ++)    if(a[i] > maxx)    maxx = a[i];    printf("%d\n",maxx * 10);    }}