can anyone write more detailed editorial for Bear and bribing tree problem from the February lunch time. I had looked at it’s editorial and I found it very difficult to understand.

Can anyone explain it with the proper **DP** approach including overlapping sub problems and brute force solution, how that problem fits in that problem, everything in very detailed way so that it could be even understood by beginners. The problem with the official editorial is that it directly talks about the dp solution and I am still not able to realize how it is a **DP** problem.

Any help would be appreciated.