NYOJ 364 HDU 1052 田忌赛马

田忌赛马

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 3

描述

Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

"Both of Tian and the king have three horses in different classes, namely, regular, plus, and super. The rule is to have three rounds in a match; each of the horses must be used in one round. The winner of a single round takes two hundred silver dollars from the loser."

"Being the most powerful man in the country, the king has so nice horses that in each class his horse is better than Tian's. As a result, each time the king takes six hundred silver dollars from Tian."

"Tian Ji was not happy about that, until he met Sun Bin, one of the most famous generals in Chinese history. Using a little trick due to Sun, Tian Ji brought home two hundred silver dollars and such a grace in the next match."

"It was a rather simple trick. Using his regular class horse race against the super class from the king, they will certainly lose that round. But then his plus beat the king's regular, and his super beat the king's plus. What a simple trick. And how do you think of Tian Ji, the high ranked official in China?"

Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...

However, the horse racing problem is a very special case of bipartite matching. The graph is decided by the speed of the horses --- a vertex of higher speed always beat a vertex of lower speed. In this case, the weighted bipartite matching algorithm is a too advanced tool to deal with the problem.

In this problem, you are asked to write a program to solve this special case of matching problem.

输入

The input consists of many test cases. Each case starts with a positive integer n (n <= 1000) on the first line, which is the number of horses on each side. The next n integers on the second line are the speeds of Tian’s horses. Then the next n integers on the third line are the speeds of the king’s horses.

输出

For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.

样例输入

3
92 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18

样例输出

200
0
0

分析

      这道题我的思路我说下，首先输入两组数据，然后进行从小到大的排序，然后，田忌的马如果速度比王的马的大的话，就循环运算，并统计这样的组数，如果有国王的马比田忌的马快时，则设置一个标记c，这个标记+1，然后让田忌的马去掉最小的一个，并重新比较，比较到n-c，如果还出现国王的马比田忌的快的话，标记再+1，然后田忌剩下的马再去掉一个，直到田忌剩下的(总数n-标记c)比国王的前n-c个马都快或相等时，计算出此时田忌的马比国王的马快的个数，然后减去标记数c，最后再乘上200，即可。

 先看一下我有BUG  的代码如下：

01. #include <stdio.h>

02. #include <string.h>

03. #include <algorithm>

04. #include <math.h>

05. using namespace std;

06. int main()

07. {

08. int t;

09. while(~scanf("%d",&t))

10. {

11. int a[1005]={0};

12. int b[1005]={0};

13. for(int i=0;i<t;i++)

14. {

15. scanf("%d",&a[i]);

16. }

17. for(int i=0;i<t;i++)

18. {

19. scanf("%d",&b[i]);

20. }

21. sort(a,a+t);        //进行排序

22. sort(b,b+t);

23. int c=0;

24. int d=0;

25. for(int i=0;i+c<t;i++)   

26. {

27. if(a[i+c]-b[i]==0)

28. {

29. d++;            //d为相等的数

30. }

31. if(a[i+c]-b[i]<0)

32. {

33. i=-1;

34. c++;          //标记数为c

35. d=0;          //d每次都要归零

36. }

37. }

38. int l=t-c-d;          //胜利数=总数-相等数-败的数目 

39. int mn=(l-c)*200;

40. printf("%d\n",mn);

41. }

42. return 0;

43. }

  

           这是贪心策略，贪心策略是什么？其实我也不懂，BUG在如

果相等的多的话，这种方法就行不通，数据小的话暴力枚举也是

可以的，但数据大的话不不行，下面是利用双指针的通用代码~

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
    int t;
    while(~scanf("%d",&t)&&t)
    {
        int a[1005]= {0};
        int b[1005]= {0};
        for(int i=0; i<t; i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0; i<t; i++)
        {
            scanf("%d",&b[i]);
        }
        sort(a,a+t);
        sort(b,b+t);
        int c=0;
        int d=0;
        int f=t-1;
        int g=t-1;
        int m=0;
        while(c!=f+1)
        {
            if(a[c]>b[d])
            {
                m+=200;
                c++;
                d++;
            }
            else
            {
                if(a[f]>b[g])
                {
                    m+=200;
                    f--;
                    g--;
                }
                else
                {
                    if(a[c]<b[g])
                    {
                        m-=200;
                        c++;
                        g--;
                    }
                    else
                    {
                        break;
                    }
                }
            }
        }
        printf("%d\n",m);
    }
    return 0;
}