Submission #64415343

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define x first
#define y second
typedef pair<int,int>pii;
const int N = 1e7 + 10;
string s;
int b,n;
struct node{
	int val,id,ran;
};
node a[N];
void solve(){
	cin >> n;
  	for(int i = 1; i <= n; i ++){
	  	cin >> a[i].val;
	  	a[i].id  = i;
	  }
	  sort(a + 1, a + 1 + n ,[&](node aa,node bb){
	  	return aa.val > bb.val;
	  });
	  int pre = -1, mi = -1;
	  for(int i = 1; i <= n ; i++){
	  	if(pre == a[i].val){
		  	a[i].ran = mi;
		  }
	  	else{
		  	a[i].ran = i;
		  	mi = i;
		  } 
	  	pre = a[i].val;
	  }
	  

	  	  
	  sort(a + 1, a + 1 + n ,[&](node aa,node bb){
	  	  	return aa.id < bb.id;
	  	  });
	  	for(int i = 1; i <= n ;i++){
		  	cout << a[i].ran << endl;
		  }
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//	int T;
//	cin>>T;
//	while(T--)	
	 solve();
	return 0;
}

Submission Info

Judge Result