题目:
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.
3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
10 20 30
思路:可以把数同时减一除2,然后排序累计取最大。
代码:
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int i,N;
while(cin>>N)
{
for(i=1;i<=N;i++)
{
int T,Ro[201],fr,to;
cin>>T;
for(int a=1;a<=200;a++)
Ro[a]=0;
for(int r=1;r<=T;r++)
{
cin>>fr>>to;
fr=(fr+1)/2;
to=(to+1)/2;
if(fr>to)
{swap(fr,to);}
for(int e=fr;e<=to;e++)
Ro[e]=Ro[e]+1;
}
int max=0;
for(int y=1;y<=200;y++)
if(max<Ro[y]) max=Ro[y];
cout<<max*10<<endl;
}
}
}
感想:自己做了很多次都没成功,听了老师讲完后才发现自己思维定式了,不能一条路走到黑。。