Submission #1455967

---

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];
vector<vector<int>> pos(100000 + 5);
vector<int> num;

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    rep(i, n) {
        cin >> a[i];
        pos[a[i]].push_back(i);
        num.pb(a[i]);
    }
    sort(all(num));
    num.erase(unique(all(num)),num.end());
    int ans = 1;
    int pre = -1;
    rep(i, num.size()) {
        int psize = pos[num[i]].size();
        int start = 0;
        rep(j, psize) {
            if (pre < pos[num[i]][j]) {
                start = j;
                break;
            }
        }
        rep2(j, start, start + psize) {
            if (pos[num[i]][j % psize] < pre) ans++;
            pre = pos[num[i]][j % psize];
        }
    }
    if (pre == 0) ans--;
    cout << ans << endl;
}

Submission Info

Judge Result