Submission #64291411

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include<unordered_map>
#define int long long

using namespace std;


signed main() {
    int n; cin>>n;
    vector<int> arr(n);
    for(int i=0;i<n;i++) cin>>arr[i];

    vector<vector<int>> pairs;
    vector<int> ans(n);

    for(int i=0;i<n;i++) pairs.push_back({arr[i], i});

    sort(pairs.rbegin(), pairs.rend());   
    int rank = 1;
    
    for(int i=0;i<n;i++) {
        int num = pairs[i][0], lastIdx = i;
        for(int j=i;j<n;j++) {
            if(pairs[j][0] == num){
                lastIdx = j;
            }else break;
        }

        for(int j=i;j<=lastIdx;j++) ans[pairs[j][1]] = rank;

        rank += lastIdx - i + 1;
        i = lastIdx;
        
    }

    for(int i : ans) cout<<i<<' ';
    cout<<endl;
    
}

Submission Info

Judge Result