Codeforces 900C Remove Extra One（思维）

C. Remove Extra One

time limit per test

2 seconds

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 a1, a2, ..., ak the element ai is a record if for every integer j (1 ≤ j < i) the following holds: aj < ai.

Input

The first line contains the only integer n (1 ≤ n ≤ 105) — the length of the permutation.

The second line contains n integers p1, p2, ..., pn (1 ≤ pi ≤ 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.

Examples

input

Copy

1
1

output

Copy

1

input

Copy

5
5 1 2 3 4

output

Copy

5

Note

In the first example the only element can be removed.

题意：一个数组，如果一个数比他前面的数都大，就称这个数为一个record数，现在让删去一个数，使得record数最多

从前往后遍历记录下最大值和次大值，对于当前的数，如果它比最大值还大，删去它只会减少一个record数,如果它小于最大值大于次大值，那么删去最大值是最优的，我想是因为我们要让前面的数尽量小，比如1 2 3 5 4，这时候删去5和删去4是一样的效果，但是如果后面有更多的数呢，那我们就应该删去这个最大的5

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+7;
int num[maxn];
int cnt[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(cnt,0,sizeof(cnt));
        int max1=0;
        int max2=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&num[i]);
            if(num[i]>max1)
            {
                max2=max1;
                max1=num[i];
                cnt[num[i]]--;
            }
            else if(num[i]>max2)
            {
                max2=num[i];
                cnt[max1]++;
            }
        }
        int ans=1;
        for(int i=2;i<=n;i++)
        {
            if(cnt[i]>cnt[ans])
            {
                ans=i;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}