Submission #1455924

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int n;
int a[100000 + 5];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    int mx = 0;
    rep(i, n) {
        cin >> a[i];
        mx = max(mx, a[i]);
        pq.push(make_pair(a[i], i));
    }
    int pre = -1;
    int ans = 1;
    bool check[n] = {};
    while (!pq.empty()) {
        pair<int, int> p = pq.top();pq.pop();
        if (p.fi == mx) {
            if (p.se == 0) {
                bool ok = true;
                rep2(i, 1, pre + 1) if (!check[i]) {ok = false; break;}
                if (!ok) ans++;
                break;
            }
            else {
                if (pre < p.se) break;
                else ans++;
            }
        }
        int now = p.se;
        if (now < pre) ans++;
        check[now] = true;
        pre = now;
    }
    //if (pre !=  0) ans++;
    cout << ans << endl;
}

Submission Info

Judge Result