Submission #1847430

---

Source Code Expand

#include <iomanip>
#include <random>
#include <time.h>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#include <string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <list>
#include <stack>
#include <set>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n, cnt = 0, b[100010];
	cin >> n;
	P a[100010];
	for (int i = 0; i < n; i++) {
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a, a + n);
	for (int i = 0; i < n; i++) {
		if (i&&a[i].first > a[i - 1].first)cnt++;
		b[a[i].second] = cnt;
	}
	for (int i = 0; i < n; i++)cout << b[i] << endl;
	return 0;
}

Submission Info

Judge Result