830B.md (2258B)
1 Source: https://codeforces.com/problemset/problem/830/B 2 3 B. Cards Sorting 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Vasily has a deck of cards consisting of *n* cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on them. 22 23 Vasily decided to sort the cards. To do this, he repeatedly takes the top card from the deck, and if the number on it equals the minimum number written on the cards in the deck, then he places the card away. Otherwise, he puts it under the deck and takes the next card from the top, and so on. The process ends as soon as there are no cards in the deck. You can assume that Vasily always knows the minimum number written on some card in the remaining deck, but doesn't know where this card (or these cards) is. 24 25 You are to determine the total number of times Vasily takes the top card from the deck. 26 27 Input 28 29 The first line contains single integer *n* (1 ≤ *n* ≤ 100 000) — the number of cards in the deck. 30 31 The second line contains a sequence of *n* integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 100 000), where *a**i* is the number written on the *i*-th from top card in the deck. 32 33 Output 34 35 Print the total number of times Vasily takes the top card from the deck. 36 37 Examples 38 39 Input 40 41 ``` 42 4 43 6 3 1 2 44 ``` 45 46 Output 47 48 ``` 49 7 50 ``` 51 52 Input 53 54 ``` 55 1 56 1000 57 ``` 58 59 Output 60 61 ``` 62 1 63 ``` 64 65 Input 66 67 ``` 68 7 69 3 3 3 3 3 3 3 70 ``` 71 72 Output 73 74 ``` 75 7 76 ``` 77 78 Note 79 80 In the first example Vasily at first looks at the card with number 6 on it, puts it under the deck, then on the card with number 3, puts it under the deck, and then on the card with number 1. He places away the card with 1, because the number written on it is the minimum among the remaining cards. After that the cards from top to bottom are [2, 6, 3]. Then Vasily looks at the top card with number 2 and puts it away. After that the cards from top to bottom are [6, 3]. Then Vasily looks at card 6, puts it under the deck, then at card 3 and puts it away. Then there is only one card with number 6 on it, and Vasily looks at it and puts it away. Thus, in total Vasily looks at 7 cards.