Once upon a time in Time-Land | Editorial by aksingh007

This is a simple DP.
ans[i]=((arr[i]+ans[i-x-1]>ans[i-1])?arr[i]+ans[i-x-1]:ans[i-1]);

```
import java.util.*;
class TestClass {
    public static void main(String args[] ) throws Exception {
        
        Scanner sc = new Scanner(System.in);
        int t=sc.nextInt();
        for(int k=1;k<=t;k++){
            long even=0L;long odd=0L;
            int n=sc.nextInt();
            int x=sc.nextInt();
            
            long arr[]=new long[n];
            long ans[]=new long[n];
            for(int i=0;i<n;arr[i++]=sc.nextLong());
            long curmax=0L;
            for(int i=0;i<=x;i++){
                if(curmax<arr[i])
                    curmax=arr[i];
                    ans[i]=curmax;
            }
            for(int i=x+1;i<n;i++) 
                ans[i]=((arr[i]+ans[i-x-1]>ans[i-1])?arr[i]+ans[i-x-1]:ans[i-1]);
            if(ans[n-1]>0)
            System.out.println(ans[n-1]);
            else
            System.out.println("0");
            //System.out.println(Arrays.toString(ans));
            }
    }
}

```

Once upon a time in Time-Land | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?