d3mon95's blog

Div2 Round 384 problem D HELP !!!
By d3mon95, history, 8 years ago, In English

I was solving questions of today's round and as usual I couldn't solve problem D which is tagged tree + DP as i have been always weak in these type of questions so someone plz help!! i would be forever in debt if anyone could suggest from where i can solve these questions, i have already tried almost all questions on codeforces, but for each of them i had to read the editorial if anyone could provide the questions from various online judges similar to today's question, i would be glad, plz HELP !!!! Also if anyone could provide some rich resources to study this topic.I know we need practie to improve in any topic so i m asking for all the questions related to this topic(preferably like today's). Plz help your brother in the name of Allah!!

  • Vote: I like it
  • +5
  • Vote: I do not like it

Comments Comments (4)
| Write comment?
»
8 years ago, # |
  Vote: I like it +2 Vote: I do not like it

why write a new blog?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    I m somewhat mew to codeforces, and this topic and these type of questions have been bothering me for days now. Sorry for any inconvenience.

    → Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

You should see hackerearth codemonk series on trees.
Also try to understand and solve questions here.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This is a tutorial on Dynamic Programming on trees.

→ Reply