Submission #1248138

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long int ll;
const ll MOD (1e9+7);
const ll INF (2e9);
const int MAX_N (200001);

int main(void) {
    int n,t;
    cin>>n>>t;
    int *a=new int[n];
    int *mina=new int[n];
    int *maxa=new int[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }

    mina[0]=a[0];
    maxa[n-1]=a[n-1];
    for(int i=1;i<n;i++){
        mina[i]=min(mina[i-1],a[i]);
        maxa[n-1-i]=max(maxa[n-i],a[n-1-i]);
    }
    int rieki=0;
    for(int i=0;i<n;i++){
        rieki=max(rieki,maxa[i]-mina[i]);
    }
    int memo=-1;
    int ans=0;
    for(int i=0;i<n;i++){
        if(rieki==maxa[i]-mina[i]&&memo!=mina[i]){
            ans++;
            memo=mina[i];
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result