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 up to 50 test cases. Each case starts with a positive integern(n1000)
on the first line, which is the number of horses on each side. The nextnintegers on the second line are the speeds of Tian's horses. Then the nextnintegers on the third line are the
speeds of the king's horses. The input ends with a line that has a single `0' after the last test case.
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
0
200
0
0
题意:田忌赛马,一场200块,求最后最多赢钱,
思路:贪心,细节比较多。
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1005;
int n, h1[N], h2[N];
void init() {
for (int i = 0; i < n; i ++)
scanf("%d", &h1[i]);
for (int i = 0; i < n; i ++)
scanf("%d", &h2[i]);
sort(h1, h1 + n);
sort(h2, h2 + n);
}
void solve() {
int ans = 0;
int s1 = 0, s2 = 0, e1 = n - 1, e2 = n - 1;
while (s1 <= e1 && s2 <= e2) {
if (h1[e1] > h2[e2]) {
e1--; e2--; ans++;
}
else if (h1[e1] < h2[e2]) {
e2--; s1++; ans--;
}
else {
if (h1[s1] == h2[s2]) {
if (h1[s1] < h2[e2]) {
e2--; s1++; ans--;
}
else {
s1++; s2++;
}
}
else if (h1[s1] > h2[s2]) {
s1++; s2++; ans++;
}
else {
e2--; s1++; ans--;
}
}
}
printf("%d\n", ans * 200);
}
int main() {
while (~scanf("%d", &n) && n) {
init();
solve();
}
return 0;
}
分享到:
相关推荐
判断输入字符串是否为镜像或回文串。 来源于UVaOJ - 401. 水题。
开源项目-codingsince1985-UVa#uva-online-judge-solutions-in-golang.zip,两年来每天都在解决一个uva在线裁判问题,算起来…
uva705 Slash Maze 的代码,在UVaOJ上通过
PDF试题
Algorithm-UVA-Solutions-in-Python.zip,python 3中各种uva(acm)问题的解决方案。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
uva532 Dungeon Master的源代码,并且AC了
这是UVA133 TheDoleQueue救济金发放问题,经典的算法问题。初学算法的人要对这种算法非常熟悉并且能熟练运用。
tpcw-nyu-uva-client 客户端
leetcode 2 算法-Java UVa Online Judge(ACM-ICPC Live ...使用:数组、哈希表、链表、二分搜索、动态规划、堆栈、堆、reedy、排序、树 DFS、BFS、图、二分搜索树、递归、记忆、队列、映射等。...Uva-ACM-ICPC