Comments
On darkshadowsDP on Trees Tutorial, 6 years ago
0

In Problem 2,

if(fValues.size()>=2)
    g[V] = 2 + fValues.back() + fValues[fValues.size()-2];

I think it should be g[V] = 1 + fValues.back() + fValues[fValues.size()-2]; darkshadows, I may be wrong, in that case, please explain that statement.

I spent time and solved D correctly. Now it's removed. If I had not attempted D first, I would fair chances that I would have solved E. Just a suggestion that you should have removed only those who had a problem. Instead of removing it for everyone.

[Deleted]