Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <vector>
- using namespace std;
- int main() {
- int n, k;
- scanf("%d%d", &n, &k);
- vector <int> a(n);
- vector <int> d(n, 0);
- int sum = 0;
- for (int i = 0; i < n; ++i) {
- scanf("%d", &a[i]);
- sum += a[i];
- if (i>= k) {
- sum -= a[i - k];
- }
- d[i] = sum;
- }
- for (int i = 1; i < n; ++i) {
- d[i] = max(d[i], d[i - 1]);
- }
- vector <int> d1(n, 0);
- sum = 0;
- for (int i = n - 1; i >= 0; --i) {
- sum += a[i];
- if (i < n - k) {
- sum -= a[i + k];
- }
- d1[i] = sum;
- }
- for (int i = n - 2; i >= 0; --i) {
- d1[i] = max(d1[i], d1[i + 1]);
- }
- int ans = 0;
- for (int i = 0; i < n - 1; ++i) {
- ans = max(ans, d[i] + d1[i + 1]);
- }
- printf("%d", ans);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement