← 返回题目

题库练习 Remove Extra One

← 上一题下一题 →

A11375 | $Remove Extra One$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a permutation $p$ of length $n$ . Remove one element from permutation to make the number of records the maximum possible. We remind that in a sequence of numbers $a_{1},a_{2},...,a_{k}$ the element $a_{i}$ is a record if for every integer $j$ ( $1<=j<i$ ) the following holds: $a_{j}<a_{i}$ .

输入格式

The first line contains the only integer $n$ ( $1<=n<=10^{5}$ ) — the length of the permutation. The second line contains $n$ integers $p_{1},p_{2},...,p_{n}$ ( $1<=p_{i}<=n$ ) — the permutation. All the integers are distinct.

输出格式

Print the only integer — the element that should be removed to make the number of records the maximum possible. If there are multiple such elements, print the smallest one.

输入输出样例

输入 #1

1
1

输出 #1

输入 #2

5
5 1 2 3 4

输出 #2

C++ 编辑器

输入

输出