Codeforces Round 450 (Div. 2) C. Remove Extra One

Remove Extra One

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

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,\dots ,a_k$ the element $a_i$ is a record if for every integer $j$ ($1\le j<i$) the following holds: $a_j<a_i$.

Input

The first line contains the only integer $n$ ($1\le n\le 10^5$) — the length of the permutation.

The second line contains $n$ integers $p_1,p_2,\dots ,p_n$ ($1\le p_i\le n$) — the permutation. All the integers are distinct.

Output

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.

Example

$\mathtt{input}$
1 1
$\mathtt{output}$
1

$\mathtt{input}$
5 5 1 2 3 4
$\mathtt{output}$
5

Note

In the first example the only element can be removed.

Tutorial

不妨转换一下题意：删除一个元素后，有多少位置的数值等于前缀最大值

所以可以对每一个位置进行计数，对于删去 $x$ 后，需要记录

• 哪些位置在删去 $x$ 后变成了前缀最大值，即该值前面只有 $x$ 这个数比该位置的数大
• 哪些位置在删去 $x$ 后不再是前缀最大值，即删除前 $x$ 就是前缀最大值

根据上面两种情况，我们可以计算每个元素删去时，满足条件的位置数值会发生怎样的变化，最后取最大值即可

此解法时间复杂度为 $\mathcal{O}(n)$

Solution

#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n, ans = 0;
    cin >> n;
    vector<int> p(n), mx(2, -1), mid(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
        if (mx[0] == -1 or p[i] > p[mx[0]]) { // 是否为最大值
            mid[i]--;
            mx[1] = mx[0];
            mx[0] = i;
        } else if (mx[1] == -1 or p[i] > p[mx[1]]) { // 是否仅小于最大值
            mid[mx[0]]++;
            mx[1] = i;
        }
    }
    for (int i = 0; i < n; ++i) {
        if (mid[i] > mid[ans] or (mid[i] == mid[ans] and p[i] < p[ans])) {
            ans = i;
        }
    }
    cout << p[ans] << endl;
    return 0;
}