Submission #1177704

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define Nmax 100000

int main(){
    int n,a[Nmax];
    cin>>n;
    priority_queue<int, vector<int>, greater<int> > q;
    int *t=new int[Nmax];
    for(int i=0;i<n;i++){
        cin>>a[i];
        q.push(a[i]);
    }
    t[0]=q.top();
    int count=1;
    while(!q.empty()){
        if(q.top()!=t[count-1]){
            t[count]=q.top();
            count++;
        }
        q.pop();
    }
    for(int i=0;i<n;i++){
        int j=0;
        while(a[i]!=t[j]&&j<Nmax)j++;
        a[i]=j;
    }
    for(int i=0;i<n;i++){
        cout<<a[i]<<endl;
    }

}

Submission Info

Judge Result