Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Sammmmmmm's blog

By Sammmmmmm, history, 10 months ago, In English

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;

  • Vote: I like it
  • 0
  • Vote: I do not like it