zoukankan      html  css  js  c++  java
  • AIM Tech Round (Div. 2) B

    B. Making a String
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given an alphabet consisting of n letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied:

    • the i-th letter occurs in the string no more than ai times;
    • the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once.
    Input

    The first line of the input contains a single integer n (2  ≤  n  ≤  26) — the number of letters in the alphabet.

    The next line contains n integers ai (1 ≤ ai ≤ 109) — i-th of these integers gives the limitation on the number of occurrences of the i-th character in the string.

    Output

    Print a single integer — the maximum length of the string that meets all the requirements.

    Sample test(s)
    Input
    3
    2 5 5
    Output
    11
    Input
    3
    1 1 2
    Output
    3
    Note

    For convenience let's consider an alphabet consisting of three letters: "a", "b", "c". In the first sample, some of the optimal strings are: "cccaabbccbb", "aabcbcbcbcb". In the second sample some of the optimal strings are: "acc", "cbc".

    题意:n种字母 每种字母分别最多出现ai次 要求 每种字母出现次数都不同

    题解 a[]排序 当前字母最多出现次数未被占据 则 exm-- 累加

    #include<bits/stdc++.h>
    using namespace std;
    #define LL  __int64
    int n;
    int a[30];
    map<int,int> mp;
    int main()
    {
        scanf("%d",&n);
        mp.clear();
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        LL ans=a[n-1];
        mp[a[n-1]]=1;
        for(int i=n-2;i>=0;i--)
        {
             int exm=a[i];
             while(mp[exm]&&exm>0)
             {
                 exm--;
             }
             ans+=exm;
             mp[exm]=1;
        }
        printf("%I64d
    ",ans);
        return 0;
    }
    

      

  • 相关阅读:
    Oracle DG备库强制switch_over过程
    Oracle硬解析,软解析,软软解析介绍
    在SQLPLUS里显示IP、用户名和实例名
    mysql-xtrabackup
    oracle external密码验证
    DBMS_MONITOR程序开启10046事件
    css样式
    PS中会使用到的快捷键有那些?
    CSS中的绝对定位与相对定位
    制作网页过程中,经常用到的代码
  • 原文地址:https://www.cnblogs.com/hsd-/p/5185105.html
Copyright © 2011-2022 走看看