Submission #1533843

---

Source Code Expand

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

#define all(x)  x.begin(), x.end()

int main() {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; i ++) cin >> a[i];
        vector<int> b = a;
        sort(all(b));
        int cnt = 0;
        map<int, int> m;
        for (int i = 0; i < n - 1; i ++)if (b[i] < b[i + 1]) m[b[i]] = cnt ++;
        m[b[n - 1]] = cnt;
        for (int i = 0; i < n; i ++) cout << m[a[i]] << endl;
        return 0;
}

Submission Info

Judge Result