B. Alyona and Mex
来源:互联网 发布:java程序异常处理 编辑:程序博客网 时间:2024/05/22 17:28
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 that1 ≤ bi ≤ ai for every 1 ≤ 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.
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.
Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations.
51 3 3 3 6
5
22 1
3
In the first sample case if one will decrease the second element value to 2 and the fifth element value to 4 then themex value of resulting array 1 2 3 3 4 will be equal to 5.
To reach the answer to the second sample case one must not decrease any of the array elements.
解题说明:此题其实是一道排序题,找到最小的正整数,保证数列中的每一个数。
#include<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>#include <map>using namespace std;int main(){long long int n,ans=1,a[100001];int i;cin>>n;for(i=0;i<n;i++){cin>>a[i];}sort(a,a+n);for(i=0;i<n;i++){if(a[i]>=ans){ans++;}}cout<<ans<<endl;return 0;}
- B. Alyona and Mex
- codeforce B. Alyona and Mex
- Codeforces 358 . B Alyona and Mex
- CodeForces 682B Alyona and Mex
- CodeForces 682B Alyona and Mex
- CodeForces 682B Alyona and Mex
- Alyona and Mex
- codeforces739A. Alyona and mex
- codeforces379a Alyona and mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex【水题】
- Codeforces Round #358 (Div. 2) B. Alyona and Mex 水题
- C - Alyona and Mex CF682B
- Codeforces Round #358 (Div. 2) B Alyona and Mex(水题)
- Codeforces Round #358 (Div. 2) -- B. Alyona and Mex (思路水题)
- B. Alyona and flowers
- JavaWeb学习总结(二)---在windows7下安装java JDK
- 现代操作系统:死锁
- 构造函数和析构函数
- java中保留2位小数的四种方法
- Linux查看CPU和内存使用情况
- B. Alyona and Mex
- WebDriverException; Capture Page Screenshot
- 算法--01.冒泡排序
- Q54:表示数值的字符串
- 【Qt开发】QThread 实用技巧、误区----但文档中没有提到
- Python Tkinter小试
- 二进制 正负数加减法 计算INT_MIN - 1=INT_MAX
- 可以用WORD发布CSDN博客啦
- python使用urllib urllib2 cookielib模拟登陆tom