蓝桥打卡-day27

 

 

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(t-- != 0){
            int n = sc.nextInt();
            int k = sc.nextInt();
            long[] a = new long[n+1];
            for(int i = 1 ; i <= n ; i++) a[i] = a[i-1] + sc.nextInt();
            int max = Integer.MIN_VALUE,min = Integer.MIN_VALUE;
            for(int i = k ; i < n- k + 1 ; i++){
                max =(int) Math.max(max,a[i]-a[i-k]);
                min =(int) Math.max(min,max+a[i+k]-a[i]);
            }
            System.out.println(min);
        }
    }
}