Junior price robot

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

The idea behind your latest business adventure, BarGain Overview (BGO), is to collect the history of prices for a certain item that is available for sale on the web. The BarGain score of a particular day is defined as the number of days since the price was lower or equal to today's price. The worst BarGain score is thus 11, and if the price is strictly better than all previous prices ever recorded, then it is infinity. You want to report the BarGain score to your customers to help them identify a good buy.

입력

The first line of input contains a single integer 2n400,0002 \leq n \leq 400\\,000, the number of days for which you have collected price data for the item. On the second line of input follows nn space-separated integers p_1,p_2,,p_np\_1, p\_2, \ldots, p\_{n}, where 0p_i21060 \leq p\_i \leq 2 \cdot 10^6 is the price of the item i1i-1 days ago. Today's price is p_1p\_1.

출력

A line containing today's BarGain score.