zoukankan      html  css  js  c++  java
  • B

    Description

    Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular, she may not apply any operation to the array at all.

    Formally, after applying some operations Alyona will get an array of n positive integers b1, b2, ..., bn such that 1 ≤ bi ≤ ai for every1 ≤ i ≤ n. Your task is to determine the maximum possible value of mex of this array.

    Mex of an array in this problem is the minimum positive integer that doesn't appear in this array. For example, mex of the array containing 1, 3 and 4 is equal to 2, while mex of the array containing 2, 3 and 2 is equal to 1.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of elements in the Alyona's array.

    The second line of the input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.

    Output

    Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations. 

    Sample Input

    Input
    5
    1 3 3 3 6
    Output
    5
    Input
    2
    2 1
    Output
    3

    题意:

    给出n个元素,元素可交换或减小,求最终缺少的最小正整数的最大值(mex)。

    仔细观察我们不难看出当n个元素为从1~n递增时mex取最大值,如n=5时,1,2,3,4,5,mex取最大值6。所以我们就将数列尽量接近连续递增数列。

    如1 3 3 3 6可改为1 2 3 3 4则取最大值mex为5。

    附AC代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 using namespace std;
     6 
     7 const int MAX=101000;
     8 
     9 int a[MAX];
    10 
    11 int main(){
    12     int n;
    13     while(cin>>n){
    14         for(int i=0;i<n;i++){
    15             cin>>a[i];
    16         }
    17         int ans=1;
    18         sort(a,a+n);//排序 
    19         for(int i=0;i<n;i++){
    20             if(a[i]>=ans)//注意等于 
    21             ans++;
    22         }
    23         cout<<ans<<endl;
    24     }
    25     return 0;
    26 } 
  • 相关阅读:
    RabbitMQ + topic发送消息+python
    maven下载依赖jar包失败处理方法--下载jar包到本地并安装到maven仓库中
    Jmeter--thrift接口压测
    将jar文件加到maven的local repository中
    在Mac机器上给ITerm2配置lrzsz,便捷的传输文件到远程服务器上
    linux iptables 开启和关闭服务端口号
    centos 安装PGSQL
    pgsql 常用的命令
    web压力测试工具
    centos安装 mysql
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/5659184.html
Copyright © 2011-2022 走看看