Grt explanation and animations!!! Can you also add a video where you explain it using XOR hashing technique mentioned in editorial? I think visualizations of those diagonals would be helpful
Thanks for the suggestion. Unfortunately, I will have to decline as my current focus is topics which will reappear frequently. I don't think xor hashing falls in that category.
for the given exercise, if the array is static we can maintain for each index r smallest value l such that all elements from l to r are equal. This is done in o(n) then for each query l,r we check if the value at r is less than equal to given value. if the array is dynamic then we can maintain two segment tree for minimum and maximum. If the value of query is same in both then all elements are equal.
Correct. This idea appeared in CF1923D : Slimes. Here is my solution using both approach that you mentioned. cfstep.com/codeforces/contests/contest-1923/problem-d/code/
I don't think it's beneficial to do topic streams currently (as the channel is still in development phase, so it might not reach a wider audience, and my efforts would be wasted). Once we have a bigger reach, we can try that. However, if these topics do appear in recent contests, I can think about adding a video on it. For example, I already have a video on SOS DP on my channel, go check it out.
Code, Slides, Contest with easy version, Practice Problems and Similar videos cfstep.com/codeforces/contests/contest-1996/problem-g/
Your explanation is amazing! Please keep updating more codeforces videos!
Your explanation is so good 💛
Please upload video regularly.
Grt explanation and animations!!!
Can you also add a video where you explain it using XOR hashing technique mentioned in editorial? I think visualizations of those diagonals would be helpful
Thanks for the suggestion. Unfortunately, I will have to decline as my current focus is topics which will reappear frequently. I don't think xor hashing falls in that category.
Nice
for the given exercise, if the array is static we can maintain for each index r smallest value l such that all elements from l to r are equal. This is done in o(n) then for each query l,r we check if the value at r is less than equal to given value. if the array is dynamic then we can maintain two segment tree for minimum and maximum. If the value of query is same in both then all elements are equal.
Correct. This idea appeared in CF1923D : Slimes. Here is my solution using both approach that you mentioned. cfstep.com/codeforces/contests/contest-1923/problem-d/code/
pls can u do HARD NON-STANDARD DP tricks like open-close interval, sos ,knuth etc..
I don't think it's beneficial to do topic streams currently (as the channel is still in development phase, so it might not reach a wider audience, and my efforts would be wasted). Once we have a bigger reach, we can try that.
However, if these topics do appear in recent contests, I can think about adding a video on it. For example, I already have a video on SOS DP on my channel, go check it out.
Bro can you make a video on how to practice at atcoder
Maybe in future.