A1015.High Card Wins--Silver

普及/提高-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

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 2N2N cards, conveniently numbered 12N1 \ldots 2N, and
divide them into NN cards for Bessie and NN cards for Elsie. The two then
play NN rounds, where in each round Bessie and Elsie both play a single card,
and the player with the highest card earns 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.

输入格式

The first line of input contains the value of N (1N50,0001 \leq N \leq 50,000).
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 Bessie's
cards from this information.

输出格式

Output a single line giving the maximum number of points Bessie can score.

输入输出样例

  • 输入#1

    3
    1
    6
    4
    

    输出#1

    2
    

说明/提示

Here, Bessie must have cards 2, 3, and 5 in her hand, and she can use these to
win at most 2 points by saving the 5 until the end to beat Elsie's 4.

首页