转载请注明出处：http://blog.csdn.net/u012860063
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1052
Tian Ji -- The Horse Racing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17346 Accepted Submission(s): 5043
"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.
3 92 83 71 95 87 74 2 20 20 20 20 2 20 19 22 18 0
200 0 0
每次取田忌的最快的马与齐王最快的马比較，有三种情况。
一、田忌最快的马比齐王最快的快，那么直接用田忌最快的马去赢齐王最快的马。
二、田忌最快的马比齐王最快的慢，那么用田忌最慢的马去输齐王最快的马。
三、田忌最快的马与齐王最快的马速度一样。
先用田忌最慢的马与齐王最慢的马比較。
若田忌比齐王快，直接赢掉齐王最慢的马。
否则田忌最慢的马再去与齐王最快的马比。
假设最快最慢的马都一样。用田忌最慢的马和齐王最快的马比。
*/
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;
#define PI acos(-1.0)
#define INF 0x3fffffff
int main()
{
int n,i,j;
int a[1047],b[1047];
while(~scanf("%d",&n) && n)
{
for(i = 1 ; i <= n ; i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
for(i = 1 ; i <= n ; i++)
{
scanf("%d",&b[i]);
}
sort(b+1,b+n+1);
int sum = 0;
int ka1,kb1;//分别计算田忌和齐王速度慢的马还未使用的当前序号边界
int ka2,kb2;//分别计算田忌和齐王速度快的马还未使用的当前序号边界
ka1 = kb1 = 1;
ka2 = kb2 = n;
for(i = n ; i >= 1; i--)
{
if(a[ka2] > b[kb2])//假设田忌最快的马比齐王最快的马快直接吃掉
{
sum+=200;
ka2--,kb2--;
}
else if(a[ka2] == b[kb2])//假设两方最快的马速度同样
{
if(a[ka1] > b[kb1])//假设田忌最慢的马比齐王最慢的快，直接吃掉
{
sum+=200;
ka1++,kb1++;
}
else if(a[ka1] <= b[kb1])//假设田忌最慢的马和齐王最慢的马速度同样或比齐王慢
{
if(a[ka1] < b[kb2])//假设田忌最慢的马比齐王最快的马慢。用最慢的去输齐王最快的
{//PS：可能会有读者吐槽，最慢的马当让比最快的慢。事实上不然。比方题目的第二个案例
sum-=200;
ka1++;
kb2--;
}
else if(a[ka1] == b[kb2])//两方的马全是一样的速度的情况，那么直接能够忽略掉钱的变化
{
ka1++,kb2--;
}
}
}
else if(a[ka2] < b[kb2])//假设田忌最快的马比齐王最快的马慢。用田忌最慢的马去输齐王最快的马
{
sum-=200;
ka1++;
kb2--;
}
}
printf("%d
",sum);
}
return 0;
}版权声明：本文博主原创文章，博客，未经同意不得转载。