Winning Codeforces Round #627 (Div. 3)

preview_player
Показать описание

If this was helpful, consider liking or subscribing!

Рекомендации по теме
Комментарии
Автор

Not only winning competition but winning our hearts by putting your time in making these live and editorial videos. Thank you so much.

ritiksingla
Автор

I was frantically sear hing for order statistics for multiset when I realised that ai-bi might repeat. That took a hell lot of time and finally had to resort to another interpretation(was mentioned in the tutorial). Certainly learned something valueable today!!!

mridulbhatt
Автор

Good Job, William. I was waiting for this video.


Till what rating do you feel confident of solving a problem in a contest ?

For example, I am confident of solving problems rated 1600 or 1700 in a contest.

I'd like to discuss F with you. I understood that DFS1 computes the maximum subtree rooted at v for every vertex v. But, I did not understand what dfs2() does. Can you please help me ?

saikatify
Автор

thanks for uploading i was able to solve Upto E but missed F, now i have got hint . Thanks

rafayeathossain
Автор

Please make a video on how you started competitive programming.

laxityadav
Автор

I did C by just counting max continuous L's + 1.. does it fail at some case?? 😛

shashanktiwari
Автор

I swear you are like an inspiration to me

mostafamarwanmostafa
Автор

First video with 0 dislike, sometimes life just surprises me!

kishanpatel
Автор

What is the best source for learn data structure & algorithm?

JackSparrw
Автор

whats the "%y+" thing you do after every code?

sharathnair
Автор

William we want more coding tutorials please!

elizabeth
Автор

How much time do you invest on programming every day ?

JackSparrw
Автор

so... you dont wait for your solution to get accepted?

fuasteriskk
Автор

now i will use while(n- -) rather than a for loop xD

jiakai
Автор

Can you suggest me a good resource to learn data structure and algorithm..
I am pretty bad at competitive programming i am barely able to solve first 2-3 question codechef long challenge..

souravsharma
Автор

Can you gave me a idea of a tree related qns??

prarinamderia
Автор

I think you should include your GitHub account in video's description.

brayaon
Автор

If it doesn't hamper your performance, please consider naming variables in a more understandable way. Your code is cool, I can follow along upto like C or D (the topics I know), but it would've been much simpler with descriptive variable names.

shreyanshsingh
Автор

I was frantically sear hing for order statistics for multiset when I realised that ai-bi might repeat. That took a hell lot of time and finally had to resort to another interpretation(was mentioned in the tutorial). Certainly learned something valueable today!!!

mridulbhatt