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 Copy
3
4
10 20
30 40
50 60
70 80
2
1 3
2 200
3
10 100
20 80
30 50
Sample Output Copy
10
20
30
本来想用面向对象的方法解决的,弄了好久,AC就是只给过一半,所以只能用类C的方法去实现了,memset函数其实可有可无,不会用的完全可以用赋值的方法直接搞定,果然是思路决定成败啊,不废话,直接上AC代码:
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int N;
cin>>N;
int n,f,s,t,R[402],max;
while(N--)
{
cin>>n;
memset(R,0,sizeof(R));//可以用R[402]代替;
for( int i=1;i<=n;i++)
{
cin>>f>>s;
if(f%2==0)
f--;
if(s%2==0)
s--;
if(f>s)//必须确保房间里的桌子是从小移到大的,否则计算重叠区间会出错
{
t=f;
f=s;
s=t;
}
for(int j=f;j<=s;j++)//经过一次这个房间就给这个房间记一次
R[j]++;
}
max=0;
for(int i=1;i<=400;i++) //重叠最多的就是我们需要统计的
{
if(R[i]>max)
max=R[i];
}
cout<<max*10<<endl;
}
return 0;
}
有兴趣的朋友可以试下用面向对象的方法解决
下面是AC50%的代码(欢迎改进版本):
#include<iostream>
using namespace std;
struct Solve
{
int begin;
int ending;
}a[100], ins;
int main()
{
int N;
cin >> N;
//N++;
int n, count = 0;
while(N--)
{
cin >> n;
a[n].begin = 1000;
a[n].ending = 1000;
count = 10;
for (int i = 0; i < n; i++)
{
cin >> a[i].begin;
cin >> a[i].ending;
a[i].ending--;
}
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
{
if (a[i].begin > a[j].begin)
{
ins = a[i];
a[i] = a[j];
a[j] = ins;
}
}
for (int i = 0; i < n; i++)
{
// cout<<n<<endl;
if (a[i].ending >= a[i + 1].begin)
count += 10;
// cout<<a[i].begin<<" "<<a[i].ending<<endl;
}
cout << count << endl;
}
return 0;
}