#PU571. USACO 2015 December Contest, Silver — Problem 2. High Card Wins

    ID: 1223 传统题 文件IO:highcard 2000ms 256MiB 尝试: 0 已通过: 0 难度: 提高 上传者: 标签>USACO赛事:dec15来源:usaco.orgscoring:equal_test_cases动态规划枚举

USACO 2015 December Contest, Silver — Problem 2. High Card Wins

USACO 2015 December Contest, Silver — Problem 2. High Card Wins

题目描述

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 1…2N1 \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 (1≤N≤50,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.

输出格式

(见题面原文)

数据范围

(见题面原文)

样例

样例 1

3
1
6
4
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.
Problem credits: Austin Bannister and Brian Dean