数组求和

mport java.util.ArrayList;
import java.util.Scanner;


public class Main {
     public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            int n = sc.nextInt();
            int m = sc.nextInt();
            int [] num = new int [n+m];
            for (int i=0;i<n;i++){
                num[i]=sc.nextInt();
            }
            sc.close();

            for (int i=n;i<n+m;i++){
                num[i]=num[i-n];
            }

            int max = 0,sum=0;
            //把前m个累加
            for (int i=0;i<m;i++)
                sum+=num[i];
            
            //后m--n+m个
            for (int i=m;i<m+n;i++)
            {
                //减去上每个数的前一个 加上后一个
               sum=sum-num[i-m]+num[i];
               
               max=Math.max(max,sum);
            }
            System.out.println(max);

        }


}