题解 | 时空漫游者的能量跳跃

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
       public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            int k = sc.nextInt();
            int n = sc.nextInt();
            long [] E = new long[n];
            for (int i = 0; i<n;i++){
               E[i] = sc.nextLong();
            }
            long dp[] = new long[n];
            dp[0] = E[0];
            for(int i = 1; i<n; i++){
                dp[i] = E[i] + maxDpNum(dp,i,k);
            }
            System.out.println(dp[n-1]);
       }
       public static long maxDpNum(long[]E,int i,int k){
            int start = Math.max(i-k,0);
            long max = E[start];
            for (int i1 = i-1; i1 >= start; i1--){
                max = Math.max(max,E[i1]);
            }
            return max;
       }
}