nyoj 364 【dp】
2016-02-29 07:57
344 查看
田忌赛马
时间限制: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
分析:
1、当田忌最快的马比齐王最快的马快时,用田忌最快的马对抗齐王最快的马,赢一场。 2、当田忌最慢的马比齐王最慢的马快时,用田忌最慢的马对抗齐王最慢的马,赢一场。 3、当1、2都不满足时,用田忌最慢的马对抗齐王最快的马,若田忌最慢的马比齐王最快的慢时,输一场,否则平局。
代码:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N=1005; int tj ,hd ; bool cmp(int a,int b) { return a>b; } int judge(int n) { sort(tj,tj+n,cmp); sort(hd,hd+n,cmp); int tl=0,tr=n-1,kl=0,kr=n-1,win=0,lose=0; while(tl<=tr) { if(tj[tl]>hd[kl]) { win++; tl++; kl++; } else if(tj>hd[kr]) { win++; tr--; kr--; } else { if(tj <hd[kl]) lose++; tr--; kl++; } } return (win-lose)*200; } int main() { int n,i; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&tj[i]); for(i=0;i<n;i++) scanf("%d",&hd[i]); printf("%d\n",judge(n)); } return 0; }
[/code]相关文章推荐
- 树的存储结构以及各自优缺点
- moon 第一章 java程序设计概念
- BQ Aquaris E 4.5 Ubuntu phone使用手册
- Android:我为何要封装DialogFragment?
- 公开课平台
- [leetcode] 286. Walls and Gates 解题报告
- 分布式文件存储FastDFS(七)FastDFS配置文件详解
- 【BZOJ4414】数量积
- 分布式文件存储FastDFS(六)FastDFS多节点配置
- 3.2 矩阵和图像类型
- 写在最前面 - 每天5分钟玩转 OpenStack(1)
- 移民,不应该是走投无路后的选择
- 第二弹:必看!如何利用“免费”噱头打造暴利后端
- 确定性这剂毒药,你喝过没
- Java8新特性-Lambda表达式
- DE29 Matrix Exponentials
- Linux split cat 分割和合并文件的指令
- Leetcode Binary Tree Vertical Order Traversal
- LEETCODE database 183. Customers Who Never Order
- Java8新特性-Lambda表达式