Not defending Fox, but Bongino stated many times that Fox wanted him to stay on the network, but he decided to leave to reduce his crazy work schedule. They did offer him a final sign-off show but he declined and opted to explain his move on his podcast and radio show. Tucker obviously WAS fired.
WTF, stop asking these questions, you can't become good in short time. It takes multiple years. He answered this question before: He learnt from USACO training.
Letting dp[i][j] be the number of points you can cover placing an interval that ends at position i with j intervals used so far, you can do it in O(nk + nlog(n)) (where k is the number of intervals) with prefix maximums. Not sure if there's a generic O(n) or O(nlog(n)) solution.
Constrained optimization for the second problem - can create a function.
Not defending Fox, but Bongino stated many times that Fox wanted him to stay on the network, but he decided to leave to reduce his crazy work schedule. They did offer him a final sign-off show but he declined and opted to explain his move on his podcast and radio show. Tucker obviously WAS fired.
Thank you so much!!
Loved the way you explained F .. great way of explaining !! Keep doing these streams, these are really great !!! :)
keep it up bro
Didn't mean this by virtual contests 🤦♂️🤦♂️😂
Can you make a video about how you became so good in such a short time. How long did you use to practice for? What are your learning methods?
WTF, stop asking these questions, you can't become good in short time. It takes multiple years. He answered this question before: He learnt from USACO training.
@@arinroday302 coming from an unrated guy...
@@arpitbisht3228 I mean, he's right
@@ColinGalen are you still in high school?
@@arpitbisht3228 Yes
I have an image of red coders as just coding faster just after seeing the question.But your so simple guy and even cracking good jokes 😂
Awesome!
What can we do if in E question no. Of platforms are also variable ie > 2 .... Thanks in Advance
Letting dp[i][j] be the number of points you can cover placing an interval that ends at position i with j intervals used so far, you can do it in O(nk + nlog(n)) (where k is the number of intervals) with prefix maximums.
Not sure if there's a generic O(n) or O(nlog(n)) solution.
Setup notepad++ code c++ ?
Some segments in the video are stamped not adjacent to each other
😅😊😅b 1:01 😊 1:03 b
this all wrong, cuz n=25
С УВ
484
556
orz
you literally beat me wot
Java performed awsome.
🖤🧡❤️🤎💚💚