Submission #75953708

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fast ios::sync_with_stdio(false); cin.tie(nullptr);
#define endl '\n'

class Solution {
public:

    // ek test solve
    void solve() {

        int n, k;
        cin >> n >> k;

        vector<ll> a(n);

        // input le rahe
        for (int i = 0; i < n; i++) cin >> a[i];

        ll total = 0;

        // positive values ka sum
        for (int i = 0; i < n; i++) {
            if (a[i] > 0) total += a[i];
        }

        // window me min(0, a[i]) ka sum
        ll cur = 0;

        for (int i = 0; i < k; i++) {
            if (a[i] < 0) cur += a[i];
        }

        ll best = cur;

        // sliding window
        for (int i = k; i < n; i++) {
            if (a[i - k] < 0) cur -= a[i - k];
            if (a[i] < 0) cur += a[i];
            best = max(best, cur);
        }

        // final answer
        cout << total + best << endl;
    }
};

int main() {
    fast

    Solution obj;
    obj.solve();

    return 0;
}

Submission Info

Judge Result