贪心算法G题

这题折磨我很久，图没看懂，所以说，题意理解错了，怎么写也是白费功夫

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

题意

把桌子从一个房间搬到另一个房间需要10分钟（不论远近），当把桌子从i房间搬到j房间，占用了i , j房间之间的走廊部分（如把桌子从1房搬到5房，占用了1,3,5门口前的走廊），只要搬桌子时，不共享相同走廊，就可以同时搬运多张桌子，问把n张桌子从s_i搬到e_i，最少需要多长时间。

思路

房间个数确定，因此走廊个数确定（这里把1,2房门口的过道定为1号走廊，以此类推，一共200个走廊），因为房间不是沿一条直线一维排布，而是两条直线，所以需要特殊处理一下位置。

刚开始会想成区间调度问题，如果重叠就++，虽然过了样例，但是不出意料的WA了。
换一下思路，想要花时间少，就要少共享走廊，共享次数最多的走廊花费的时间最长，而这恰好等于所用的时间。
因此，只需求出走廊的最大共享次数，即重叠次数最多是多少。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int t,n,s,e,road[201],ss,ee;
int main(){
    cin>>t;
    while(t--){
        cin>>n;
        for(int i=0;i<n;i++){
            cin>>s>>e;
            if(s>e)swap(s,e);
            //一定要判断一下起点终点大小
            ss=(s+1)/2;
            ee=(e+1)/2;
            for(int i=ss;i<=ee;i++)
                road[i]++;
        }
        int now=road[0];
        for(int i=1;i<=200;i++)
            if(road[i]>now)now=road[i];//找最大值
        cout<<now*10<<endl;
        memset(road,0,sizeof(road));
    }
}