codeforces Remove Extra One（思维）

C. Remove Extra One
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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
1
1
output
1
input
5
5 1 2 3 4
output
5
Note
In the first example the only element can be removed.

可以删掉一个，使得j < i ,a[j] < a[i] i的个数最大

考虑在i这个位，a[i]是 [1…i] 内的第二大的数，那么删掉最大的数的贡献是 cnt[max[i..i]]++。
考虑删除当前的数，如果是 [1..i] 内最大的数，那么cnt[a[i]–;
求个最大就好，因为算的是一个增减情况，所以会有负数

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

int cnt[101000];
int x[101000],y[101000],a[101000];
int main()
{
    int n;
    cin>>n;
    memset(x,0,sizeof(x));
    memset(y,0,sizeof(y));
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        x[i]=x[i-1],y[i]=y[i-1];
        if(a[i]>x[i]) 
        {
            y[i]=x[i];
            x[i]=a[i];
        }
        else if(a[i]>y[i])
            y[i]=a[i];
    }

    int res=1;
    for(int i=1;i<=n;i++) if(a[i]==y[i]) cnt[x[i]]++;
    for(int i=1;i<=n;i++) if(a[i]==x[i]) cnt[x[i]]--;
    int ans=cnt[1];
    for(int i=2;i<=n;i++) if(cnt[i]>ans) ans=cnt[i],res=i;
    cout<<res<<endl;
}