AT2412 最大の和
https://www.luogu.com.cn/problem/AT2412
题意
- 一个数组,求连续k个数字的最大和
想法
- 前缀和+遍历
- 构造这个数组的前缀
- 遍历【i-k+1,i】的和,找到最大的和
//AT2412 最大の和
// Created by majoe on 2020/5/27.
//https://www.luogu.com.cn/problem/AT2412
#include <bits/stdc++.h>
using namespace std;
int maxx = -1e9;
int n,a[100010],k,s[100010];//s为前缀和数组
int main(){
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
s[i] = a[i];
}
cin >> k;
//构造前缀和
for (int i = 1; i <= n; ++i) {
s[i] += s[i-1];
}
for (int i = k; i <= n ; ++i) {
int x = s[i] - s[i-k];
maxx = max(x,maxx);
}
cout << maxx;
return 0;
}