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
不想动脑,直接统计重复的最大区间(写的时候,我还一直认为死活都不会AC的):
一开始(中间若干代码已省略)的代码如下:
for(int i = 0; i < n; i++){
scanf("%d %d", &a[i].st, &a[i].en);
}
for(int i = 0; i < n; i++){
for(int j = a[i].st; j <= a[i].en; j++){
vis[j]++;
if(vis[j] > maxn){
maxn = vis[j];
}
}
}
即先完全输入,再进行处理,时间复杂度明显偏大,之后突发奇想,一边输入一边处理,时间复杂度有效降低。
//又学会了一种无赖打法
另外,因为n和n+1(n为奇数)共用同一区域走廊,例:1号走时,2号不能动
所以,把他们统一到某一边处理比较方便
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct st{
int st,en;
}a[205];
int comp(const st &s1, const st &s2){
return s1.st < s2.st;
}
int main(){
int t;
scanf("%d", &t);
while(t--){
int n;
scanf("%d", &n);
int vis[405];
int maxn = 0;
memset(vis, 0, sizeof(vis));
sort(a, a + n, comp);
for(int i = 0; i < n; i++){
scanf("%d %d", &a[i].st, &a[i].en);
if(a[i].st % 2) a[i].st++;
if(a[i].en % 2) a[i].en++;
if(a[i].st > a[i].en){
swap(a[i].st, a[i].en);
}
for(int j = a[i].st; j <= a[i].en; j++){
vis[j]++;
if(vis[j] > maxn){
maxn = vis[j];
}
}
}
printf("%d\n",maxn * 10);
}
}