提出 #76970373

---

ソースコード 拡げる

import java.util.*;

public class Main {

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        List<Integer> peaks = new ArrayList<>();
        for(int i = 0; i < n; i++) {
            int a = sc.nextInt();
            peaks.add(a);
        }
        List<Integer> sortedPeaks = new ArrayList<>(peaks);
        Collections.sort(sortedPeaks);

        for(int peak : peaks) {
            int index = binarySearch(sortedPeaks, peak);
            int greater = peaks.size() - index;
            System.out.print(greater + " ");
        }
    }

    public static int binarySearch(List<Integer> list, int x) {
        int low = 0, high = list.size();

        while (low < high) {
            int mid = low + (high - low) / 2;
            if (list.get(mid) <= x) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }

        return low;
    }
}

提出情報

ジャッジ結果