先將數組進行排序,第一次循環,將不重疊的元素從數組中刪除(這裏將flag賦值爲false),sum+=10
繼續第二次循環,以此類推,直到數組中沒有元素(flag全爲false)
注意的問題:
1.排序前要進行交換,的將小放在start,大的放在end
2.測試數據
1
2
1 3
4 8
3和4是重疊的,因爲他們在對門,共用走廊
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6112 Accepted Submission(s): 2038
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.