提交时间:2024-01-25 09:19:19

运行 ID: 127504

#include<bits/stdc++.h> using namespace std; struct co{ int point,m; }a[1505]; int main(){ int n,k=1; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].point; } for(int i=1;i<=n;i++){ if(a[i].point>a[i+1].point) a[i].m=k; else if(a[i].point==a[i+1].point){ a[i].m=k; a[i+1].m=k; } else a[i+1].m=k; k++; } /* for(int i=1;i<=n;i++){ for(int j=i+1;j<=n;j++){ if(a[i].m>a[j].m) swap(a[i].m,a[j].m); } }*/ for(int i=1;i<=n;i++){ cout<<a[i].point<<" "<<a[i].m<<endl; } }