hdoj 1050 Moving Tables【贪心区间覆盖】

Moving Tables

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

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

 

题解：因为是双排房间，所以对面的两间不可能同时往外搬桌子如1 2处在对面数据

1  2

3  4

结果应该是20，而不是10，

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAX 1100
using namespace std;
int dp[MAX];
bool cmp(int a,int b)
{
	return a>b;
}
int main()
{
	int n,t,m,i,j;
	scanf("%d",&t);
	int a,b,c;
	while(t--)
	{
		scanf("%d",&n);
		memset(dp,0,sizeof(dp));
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&a,&b);
			if(a>b)
			{
				c=a;
				a=b;
				b=c;
			}
			a=(a+1)/2;
			b=(b+1)/2;
			for(j=a;j<=b;j++)
			{
				dp[j]++;
			}
		}
		sort(dp,dp+200,cmp);
		printf("%d\n",dp[0]*10);
	}
	return 0;
}