- C++
离散化
-
wengzhaoyu8
LV 9
@
2025-12-12 13:23:29
#include<bits/stdc++.h> using namespace std; const int maxn=1e4+5; int n,a[maxn],b[maxn]; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; b[i]=a[i]; } sort(a+1,a+1+n); for(int i=1;i<=n;i++){ int p=lower_bound(a+1,a+1+n,b[i])-a; cout<<p<<" "; } return 0; }
6 条评论
-
wuzhaojin LV 6 @ 2026-1-6 16:43:51不行
-
@ 2025-12-22 13:57:21
能不能点个赞？
-
@ 2025-12-17 13:44:37
可复制版
-
@ 2025-12-17 13:43:13
#include<bits/stdc++.h> using namespace std; const int maxn=1e4+5; int n,a[maxn],b[maxn]; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; b[i]=a[i]; } sort(a+1,a+1+n); for(int i=1;i<=n;i++){ int p=lower_bound(a+1,a+1+n,b[i])-a; cout<<p<<" "; } return 0; }``` -
@ 2025-12-12 13:25:18
可以去复制题喔
👎 1🤣 1 -
@ 2025-12-12 13:24:08
666
👍 1
- 1
