Submission #1177699

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define Nmax 100000
#define Numm 1000000000
int main(){
    int n,a[Nmax];
    cin>>n;
    priority_queue<int, vector<int>, greater<int> > q;
    int *t=new int[Numm];
    for(int i=0;i<n;i++){
        cin>>a[i];
        q.push(a[i]);
    }
    int res=-1;
    for(int i=0;!q.empty();i++){
        if(q.top()!=res){
            t[q.top()]=i;
        }else i--;
        res=q.top();
        q.pop();
    }
    for(int i=0;i<n;i++){
        a[i]=t[a[i]];
    }
    for(int i=0;i<n;i++){
        cout<<a[i]<<endl;
    }

}

Submission Info

Judge Result