MovingTablesTimeLimit:2000/1000MS(Java/Others)????MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):19156????AcceptedSubmission(s):6532ProblemDescriptionThefamousACM(AdvancedComputerMa"/>

HDU1050:Moving Tables

Posted zhchoutai

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU1050:Moving Tables相关的知识,希望对你有一定的参考价值。

php?

pid=1050">Moving Tables

Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19156????Accepted Submission(s): 6532


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

贪心题,左右两边数可看为一区间。求出最大的区间重叠数再乘以10就可以。。


#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

const int maxn = 400 + 50;

int cas;
int n;
int p, q;
int vis[maxn];
int ans_minute;

int main()
{
    scanf("%d", &cas);
    while( cas-- )
    {
        scanf("%d", &n);
        memset(vis, 0, sizeof(vis));
        while( n-- )
        {
            scanf("%d%d", &p, &q);
            p = (p-1) / 2;//压缩
            q = (q-1) / 2;
            if( p>q ) swap(p, q);
            for(int i=p; i<=q; i++)vis[i]++;
        }
        int max_repeat = 1;
        for(int i=0; i<200; i++)
            if( vis[i]>max_repeat )
            max_repeat = vis[i];
        ans_minute = max_repeat * 10;
        printf("%d\n", ans_minute);
    }
}





以上是关于HDU1050:Moving Tables的主要内容,如果未能解决你的问题,请参考以下文章

HDU-1050 Moving Tables

HDU 1050 Moving Tables

hdu1050Moving Tables(贪心)

HDU1050 Moving tables

hdu 1050 Moving Tables(迷之贪心...)

Hdoj 1050.Moving Tables 题解