scrip only mini method side n) class name tar

Moving Tables

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

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

題意：有400個房間兩邊各200個，中間有一條走廊，在房間之間搬桌子，走廊的寬度只能容納一張桌子，所以如果1號房間搬桌子到5號房間的時候二號房間就不能搬桌子，因為這塊區域的走廊塞滿了，但7號房間的走廊還是空的，可以搬，搬一次需要10分鐘。問搬完給出的桌子需要多少時間。

題解：之間搬桌子的那塊區域作為下標的數組值+10，每次都這樣。最後這個數組中的最大值就是搬完所有桌子的時間。每次搬桌子的路徑都可以看成是從低編號房間搬到高編號房間。這樣方便為那塊區域的數值+10，因為房間是面對面的，所以計算區域的時候可以從奇數編號房間到偶數編號房間。這樣區域比較全。

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int a[410];
 4 int main() {
 5     int t;
 6     while(~scanf("%d",&t)) {
 7         while(t--) {
 8             int n;
 9             memset(a,0,sizeof(a));
10             scanf("%d",&n);
11             int maxx=0;
12             for(int i=0; i<n; i++) {
13                 int start,end;
14                 scanf("%d %d",&start,&end);
15                 if(start>end)swap(start,end);
16                 if(start%2==0) {
17                     start-=1;
18                 }
19                 if(end%2)end+=1;
20                 for(int j=start; j<=end; j++) {
21                     a[j]+=10;
22                     maxx=max(maxx,a[j]);
23                 }
24             }
25             printf("%d\n",maxx);
26         }
27 
28     }
29     return 0;
30 }

hdu1050Moving Tables(貪心)