I have heard about the problem with this statement:
You are given an integer array. You need to perform two types of queries:
1. " pos val " — assign val to position pos.
2. " l r " — find MEX on the segment from l to r.
Does anyone know where can this problem be found?
Sorry, misunderstood.
its not offline is it ?
don't know about that problem but here is one that is kinda similar...maybe harder.. http://codeforces.me/contest/817/problem/F hope it helps
Thank you, anyway)
Can be done using : http://codeforces.me/blog/entry/44711?#comment-292040
http://codeforces.me/problemset/problem/842/D?locale=en