题解 | 左侧严格小于计数

//noob 42 c语言版
//类似冒泡排序的逻辑
#include <stdio.h>

int main() {
    int count = 0;
    int n = 0;
    int arr[99] = { 0 };
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    for (int i = 0; i < n; i++) {
        if (i == 0) {
            count = 0;
        }
        for (int j = i - 1; j >= 0; j--) {
            if (arr[i] > arr[j])
                count++;
        }
        printf("%d ", count);
        count = 0;
    }
    return 0;
}