mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-02 23:56:29 +00:00
19 lines
335 B
C++
19 lines
335 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
||
|
using namespace std;
|
||
|
|
||
|
int n, k, ans, a[100005], f[100005];
|
||
|
|
||
|
int main() {
|
||
|
cin >> n >> k;
|
||
|
for (int i = 1; i <= n; i++) {
|
||
|
cin >> a[i];
|
||
|
f[i] = f[i - 1] + a[i];
|
||
|
}
|
||
|
for (int i = k; i <= n; i++) {
|
||
|
ans = max(ans, f[i] - f[i - k]);
|
||
|
}
|
||
|
cout << ans << endl;
|
||
|
return 0;
|
||
|
}
|