A. GukiZ and Contest-Codeforces Round #307 (Div. 2)-简单水题

#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>using namespace std; int a[2000+5];int vis[2000+5];int main(){int i,j,n;scanf("%d",&n);  for (i=1;i<=n;i++)  {  scanf("%d",&a[i]);  vis[a[i]]++;  }  for (i=1;i<=n;i++)  {  int cun=0;  for (j=2000;j>a[i];j--)  {  if (vis[j])  cun+=vis[j];  } if (i!=1) printf(" ");  printf("%d",1+cun);  }cout<<endl;return 0;}