Hi can someone help me with this problem? Thanks
Link: https://oj.uz/problem/view/JOI18_candies
For every k where 1 <= k <= n / 2, find out what's the maximum total value you can achieved by choosing k elements from an array of n integers, and no 2 consecutive elements are chosen.
N <= 2e5;
Have you found the solution? Can you explain it to me?
Hint: Try solving it with weighted maximum matching, and optimize it further.