Submission #3052116

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
pair<int,int>p[100000];
int main(){
    int n,ans[100000],now=0;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>p[i].first;
        p[i].second=i;
    }
    sort(p,p+n);
    ans[p[0].second]=0;
    for(int i=1;i<n;i++){
        if(p[i].first!=p[i-1].first)now++;
        ans[p[i].second]=now;
    }
    for(int i=0;i<n;i++)cout<<ans[i]<<endl;
    return 0;
}

Submission Info

Judge Result