zoukankan      html  css  js  c++  java
  • Codeforces Round #307 (Div. 2) A. GukiZ and Contest 水题

    A. GukiZ and Contest

    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://codeforces.com/contest/551/problem/A

    Description

    Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.

    In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.

    He thinks that each student will take place equal to . In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.

    GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.

    Input

    The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.

    The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).

    Output

    In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.

    Sample Input

    3
    1 3 3


    Sample Output

    3 1 1

    HINT

    题意

    给这n个学生排名

    题解:

    排个序,撸一遍就好了

    代码:

    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <ctime>
    #include <iostream>
    #include <algorithm>
    #include <set>
    #include <vector>
    #include <sstream>
    #include <queue>
    #include <typeinfo>
    #include <fstream>
    #include <map>
    #include <stack>
    typedef long long ll;
    using namespace std;
    //freopen("D.in","r",stdin);
    //freopen("D.out","w",stdout);
    #define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
    #define test freopen("test.txt","r",stdin)  
    #define maxn 2000001
    #define mod 10007
    #define eps 1e-9
    const int inf=0x3f3f3f3f;
    const ll infll = 0x3f3f3f3f3f3f3f3fLL;
    inline ll read()
    {
        ll x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
        while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
        return x*f;
    }
    //**************************************************************************************
    
    
    struct node
    {
        int x,y;
    };
    bool cmp(node a,node b)
    {
        return a.x>b.x;
    }
    node a[maxn];
    int b[maxn];
    int main()
    {
        int n=read();
        for(int i=1;i<=n;i++)
            a[i].x=read(),a[i].y=i;
        sort(a+1,a+1+n,cmp);
        int last=-inf;
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            if(last!=a[i].x)
            {
                ans=i;
                last=a[i].x;
            }
            b[a[i].y]=ans;
        }
        for(int i=1;i<=n;i++)
            cout<<b[i]<<" ";
    }
  • 相关阅读:
    HTML5 图片预览
    ubuntu JAVA 安装
    跟着老猫来搞GO内建容器Map
    面试造火箭系列,栽在了cglib和jdk动态代理
    跟着老猫来搞GO,"面向对象"
    跟着老猫来搞GO内建容器slice
    跟着老猫来搞GO,基础进阶
    JavaScript中利用doucument.writeline()方法预生成代码的小技巧
    javascript学习记录
    你的逻辑性强吗?
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4572907.html
Copyright © 2011-2022 走看看