How can we efficeiently find MEX(minimum excluded) of an array?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | BledDest | 145 |
9 | Um_nik | 145 |
How can we efficeiently find MEX(minimum excluded) of an array?
Name |
---|
For c++, just use set. But it will only work for arr[i] <= 1000000.
If value is not matter, we can compress the array so that each element will have the value in
[1..n]
UwUmay be you are referencing kdjonty31's method
Can you please tell me why it will not work for arr[i] > 1000000
because normal set<long long.> s; easily takes value upto 10^17
Example: n = 9, 0 3 5 7 2 4 1 10 19
delete (>= n) 0 3 5 7 2 4 1
sorting 0 1 2 3 4 5 7
analysis of 0-index
0 in 0 position, 1 in 1 position ... 5 in 5 position, 7 in 6 position
then the answer is 6
//google translate
I saw all the other comments almost cover the approaches, although I'd like to share one of the approaches I use most frequently. The approach takes O(NlogN) precomputation, but each MEX query takes O(1) time and updates the MEX of an array in O(logN) for every point update in the array.
In C++ :-
Precomputation:
- Create a set and a frequency map(or array).
- Fill the set with all numbers from 0 to n+1.
- Now, traverse in the array, if the element is within [0, n+1] remove it from the set, and keep updating the frequency map(or array). It takes at worst O(NlogN) time.
- Now, for any state, the set.begin() will give the MEX of the current array.
For updates:
- If the element to be replaced, is within [0, n+1] then update its frequency in the frequency map(or array) and if after updating, the frequency of that element becomes zero, insert it into our set. It takes O(logN) time.
- Now if the element which is placed in that position is within [0, n+1] then update its frequency in the frequency map(or array) and remove it from our set(if its present). It takes O(logN) time.
- And yet again, after any update, set.begin() will give us the current MEX in O(1).
A sample code where I used this technique to find MEX in queries : 86004255 :)
I am also using this one.
Great description ;)
Cool and Thanks! :)
Very good explanation
Thanks! :)
thanks for ur contribution
it's my pleasure! :)
Awesome explanation...
Hii
hlo
Would this code, to make a function, be okay?
I'm assuming that the elements are in the range [0, n] inclusive where n is the length of the array.
I just use a bool array to keep track of the elements I've encountered and I output the smallest one I haven't.
Actually the range of the elements won't matter, only the elements in the range [0, n+1] will affect the MEX. :)