本文共 2557 字，大约阅读时间需要 8 分钟。
Problem I: Moving Tables
Time Limit: 1 Sec Memory Limit: 32 MB Submit: 171 Solved: 63 [ ][ ][ ] 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
这题普遍有两种做法一种就是找到房间覆盖次数最多的数输出即可；一种是用贪心，这种尽可能找最多移动房间数目（也就是对应的最多的活动节目数量）就是根据活动结束的时间排序，因为这样才能为未安排活动留下尽可能多的时间，同样的道理，这题我选择按房间尾数小的数排序也是希望留下的走廊的路径长度更长使尽可能多的房间可以移动。 #include #include using namespace std;int rooms[201]={0};int main(){ int T,N,begin,end,max; scanf("%d",&T); while(T--){ max=0; for(int i=0; i<201; i++) rooms[i]=0; scanf("%d",&N); for(int j=0; j end) swap(begin,end); for(int k=(begin+1)/2; k<=(end+1)/2; k++) rooms[k]++; } for(int g=0; g<201; g++) if(rooms[g]>max) max=rooms[g]; printf("%d\n",max*10); }}
转载地址：http://wtfci.baihongyu.com/