Need help in understanding solution

I need help in understanding dynamic programming solution Need help in understanding dp solution to this problem - Codeforces.
Problem - 1373D - Maximum Sum on Even Positions
If someone can explain what is the interpretation of dp[i+2][1], dp[i+1][2] It will be really helpful.