Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Comments
+5

Looks Nice.
-8

Please anyone explain problem C DP problem. It's states and recurrence relation.
+3

https://codeforces.com/blog/entry/20284

Scroll down to comments. You will get a list of Dp problems medium level. I also have started solving.

One more resource: SameerGulati Sameer Gulati's answer on Quora
On ZenWoR → Subarray problems algorithms, 4 years ago
0

One thing is no of subarrays ending at ith position. This thought can help.

Like in questions LIS we say length of LIS ending at i. Practice Problem : Eugene and an array
0

Your videos are very helpful because they show to the point thinking.And they are really short time 5/6 min only.

I saw your last Div 3 video E. I was very confused for this problem. But after watching your video I got to know the very basic first approach that was brute force then visualizing it as a DP wheras others just explained it as a DP never told why Dp.
0

Nice contest for beginners like me. Thanks Mike Mirzayanov.
0

Thanks.
On zeus_iitg → Another problem on graphs, 4 years ago
+8

From which website the problem is taken? I've never heard.
0

Explain C in simple language and example.
0

Can you also provide a better explanation link for Div 2D.
0

Anyone explain properly in simple language Div 2C.
On omggg → Re-rooting Tree DP?, 4 years ago
0

Tutorial : https://codeforces.com/blog/entry/68139 Problem : https://codeforces.com/contest/1187/problem/E Read it's official editorial too.

It's not that hard concept.
0

If two numbers are same then simply their difference will be 0.
0

If Suppose A=2a+1 then |A-a|=a+1 so better convert a to 1. So, the difference then will be a-1.
0

Explain E?
On Wild4Stone → Questions on Probability, 4 years ago
+4

Check Brilliant.
0

Anyone explain A