课程练习一 problemA id1000

*题目编号：课程练习一 problemA  id：1000

*简单题意：在一个只能同时搬运一张桌子的走廊里，从一个房间向另一个房间搬桌子，最短用时

*解题思路：这道题，刚开始以为是普通的贪心算法，照着一般的思路写完了，果然，wrong answer。回过头来，仔细想了一下，到底是遗漏了什么，然后就发现我默认第一个房间的编号比第二个编号大，其实不然，所以又写了一个交换函数，在输入的时候比较大小，如果前面的数大于后面的数，就交换。自以为正确的我又提交了，→_→，又是wrong answer.这次我就纳闷了，心里就在想，是不是漏了什么特殊值，然后果然发现了一些特殊的，比如（10，20），（20，30），（30，40），（40，50），（50，60），这在我的算法里输出的是30；发现了这样的问题，我发现我之前算法的思路不能解决这种问题，于是就决定换种思路重新写。

仔细观察题目，看着题目上的图，我突然发现，走廊重合的地方不就是要分开走的吗，而重合次数最多的就是所要花的最小时间/10，于是就按着之前的一些思路，将走廊分成200段，定义成一个数组a[201];每从房间i 到 j运桌子,就将i[i,j]区间的所有走廊加10;所以最后，将数组最大值输出，就是所要花的最小时间。

*感想：一道题从昨天晚上做到今天，也是醉了。期间脑子里一直在想，到底是哪里出了问题，都快崩溃了，不过，看到Accept的时候，心里的感觉，真爽。

*AC代码：

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct table{
int first;
int last;
}t[201];
bool cmp(int a,int b)
{
return a>b;
}
int main()
{

int a[201];
int i,n,T;
cin>>T;
for(i=0;i<T;i++)
{
cin>>n;
memset(a,0,sizeof(a));
int j;
for(j=1;j<=n;j++)
{
cin>>t[j].first>>t[j].last;
if(t[j].first>t[j].last)
{
int temp;
temp=t[j].first;
t[j].first=t[j].last;
t[j].last=temp;
}
for(int k=(t[j].first+1)/2;k<=(t[j].last+1)/2;k++)
a[k]+=10;
}
sort(a,a+201,cmp);
cout<<a[0]<<endl;


}
return 0;
}

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