额....红题爆0......

#include<iostream>
#include<algorithm>
using namespace std;
int lovely[105], n, ans[105];
int main(){
    cin >> n;
    for(int i = 1 ; i <= n ; i ++)
        cin >> lovely[i];
    for(int i = 1 ; i <= n ; i++)
        for(int j = i - 1; j >= 0; j--)
        {
            if(lovely[i] > lovely[j])ans[i]++;
        }
    for(int i = 1 ; i <= n ; i++)
        cout << ans[i] << " ";
    return 0;
}

大佬救命！！！