Hey! Just a tip: if you also add 0:00 time stamp, the time stamps will automatically appear in the video: support.google.com/youtube/answer/9884579?hl=en
Quick question. I was wondering as a Java main, what do you use as a substitute to order statistic trees that exist as policy based data structures in the C++ library. Do you use your own implementation of a tree or do you have some other work around? I know this question is not directly related to the video, but I wasn't sure where else to ask you. Thanks again for this video series!
Good question. It is pretty infuriating that there is really no built in alternative. One of my teammates said “This problem wasn’t hard, but the whole time I was solving it, I was just annoyed that I didn’t have treeset.numberLessThan.” There is just no reason it shouldn’t exist. In practice, usually you can either make do with a fenwick tree to count less than with some precomputation, or if you really can’t do that and you actually need online order statistics, I have a treap that I use which can do that. It’s not as fast as the built in c++ stuff though, which is annoying. Also that teammate has his own custom treeset, but it is terribly slow in practice, so it really only works on solutions where the time limit isn’t too tight.
@@SecondThread Thanks for the prompt reply! It's an unfortunate situation, but I appreciate the insight into the workarounds you and your team have been using.
Hello! Thanks for what you are doing ! I also think that showing a bit of code on how you implemented your version of convex hull could help us understand even better how we could use it . This might make the video longer, but imo thats completely worth it :D
Great place to ask questions: codeforces.com/blog/entry/79862
Finally someone explaining thoroughly advanced algorithms
Keep it up :)
Hey! Just a tip: if you also add 0:00 time stamp, the time stamps will automatically appear in the video: support.google.com/youtube/answer/9884579?hl=en
Ah, thanks!
Thanks a lot for your videos. They help a lot.
You've been spelling 'competitive' programming wrong. Great videos otherwise!
Thanks for catching that!
Cool episode !
thnx for the videos
Thanks alot brdr😃
Nice explanation.
first lol
please make videos on convex hull , divide and conquer dp optimization technique
Great video, also can you write Convex Hull Trick's code and mention it's implementations in your next video?
Best ❤️
Great stuff.
i love your gaming chair
time stamps please
Yeah, they are already in the description if you click “read more”
Quick question. I was wondering as a Java main, what do you use as a substitute to order statistic trees that exist as policy based data structures in the C++ library. Do you use your own implementation of a tree or do you have some other work around? I know this question is not directly related to the video, but I wasn't sure where else to ask you. Thanks again for this video series!
Good question. It is pretty infuriating that there is really no built in alternative. One of my teammates said “This problem wasn’t hard, but the whole time I was solving it, I was just annoyed that I didn’t have treeset.numberLessThan.” There is just no reason it shouldn’t exist. In practice, usually you can either make do with a fenwick tree to count less than with some precomputation, or if you really can’t do that and you actually need online order statistics, I have a treap that I use which can do that. It’s not as fast as the built in c++ stuff though, which is annoying.
Also that teammate has his own custom treeset, but it is terribly slow in practice, so it really only works on solutions where the time limit isn’t too tight.
@@SecondThread Thanks for the prompt reply! It's an unfortunate situation, but I appreciate the insight into the workarounds you and your team have been using.
the best
Hello! Thanks for what you are doing ! I also think that showing a bit of code on how you implemented your version of convex hull could help us understand even better how we could use it . This might make the video longer, but imo thats completely worth it :D