printРабочее место участника


1927. F7

Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод copy
Послать решение Blockly Посылки Темы Где Обсудить (0)

The fictional World Championship of Formula 7 Drivers 2012 was characterized by exciting races and frequent shifts of driver positions on the leaderboard. Antun has missed most of it because he was training for olympiads in informatics. Now his only consolation are his medals and being the main character in this task. He has a simple question for you COCI contestants: „How many drivers participating in this Championship still had a chance to become Formula 7 World Champion at the start of the final race?” The World Champion is, of course, the driver with the largest point total at the end (after the final race).
There are `N` drivers participating in the Championship. They are all assigned points after each race, including the final one. The winner of the race is awarded N points, the runner-up gets `N\ -\ 1` points, and so on until the last driver, who gets 1 point. Two drivers cannot finish a race in the same spot. Write a program to calculate, based on the total number of points that each driver has earned before the final race, how many drivers still have a chance to have the largest total after the final r ace and thus win the Championship. If more than one driver has the same maximum point total, they are all awarded the World Champion title.
The first line of input contains the positive integer `N` (`3\ ≤\ N\ ≤\ 300\ 000`), the number of drivers participating in the Championship.
Each of the following `N` lines contains a single integer `B_i` (`0\ ≤\ B_i\ ≤\ 2\ 000\ 000`, `i\ =\ 1,\ …,\ N`), the number of points that a driver has before the final race.
The first and only line of output should contain the requested number of drivers that can still win.

Sample Input #1


Sample Output #1


Sample Input #2


Sample Output #2

Source: COCI 2012/2013, contest #1