- 1、本文档共4页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
USACO 2015 December Contest Gold usaco月赛
USACO 2015 December Contest, Gold Problem 1. High Card Low Card (Gold) Bessie the cow is a huge fan of card games, which is quite surprising, given her lack of opposable thumbs. Unfortunately, none of the other cows in the herd are good opponents. They are so bad, in fact, that they always play in a completely predictable fashion! Nonetheless, it can still be a challenge for Bessie to figure out how to win. Bessie and her friend Elsie are currently playing a simple card game where they take a deck of 2N cards, conveniently numbered 1…2N , and divide them into N cards for Bessie and N cards for Elsie. The two then play N rounds, where in each round Bessie and Elsie both play a single card. In the first N/2 rounds, the player with the highest card earns a point, and in the last N/2 rounds, the rules switch and the player who plays the lowest card wins a point. Given that Bessie can predict the order in which Elsie will play her cards, please determine the maximum number of points Bessie can win. INPUT FORMAT (file cardgame.in):The first line of input contains the value of N (2≤N≤50,000 ; N will be even). The next N lines contain the cards that Elsie will play in each of the successive rounds of the game. Note that it is easy to determine Bessies cards from this information. OUTPUT FORMAT (file cardgame.out):Output a single line giving the maximum number of points Bessie can score. SAMPLE INPUT:41843SAMPLE OUTPUT:2Here, Bessie must have cards 2, 5, and 6, and 7 in her hand, and she can use these to win at most 2 points, by saving her 2 card until one of the hands in the second half of the game. Problem credits: Brian Dean USACO 2015 December Contest, Gold Problem 2. Fruit Feast Bessie has broken into Farmer Johns house again! She has discovered a pile of lemons and a pile of oranges in the kitchen (effectively an unlimited number of each), and she is determined to eat as much as possible. Bessie has a maximum fullness of T (1≤T≤5,000,000 ). Eating an orange increases h
文档评论(0)