https://codeforces.com/blog/entry/79376 See Problem — 1373D — Maximum Sum on Even Positions
I have solved this problem using other method but I'm unable to understand dynamic programming solution. I'm not able to write recursive solution also. Any help will be greatly appreciated.