Submission #1533611

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<pair<int, int> > a(N);
    REP (i, N) {
        int tmp;
        cin >> tmp;
        a[i].first = tmp;
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    int value = -1, used = -1;
    vector<int> b(N);
    REP (i, N) {
        if (a[i].first <= used)
            b[a[i].second] = value;
        else {
            b[a[i].second] = ++value;
            used = a[i].first;
        }
    }

    REP (i, N)
        cout << b[i] << endl;
}

Submission Info

Judge Result