1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>

using namespace std;

int n, q, k, l, r;
const int MAX = 3 * 100005;
long long tab[MAX];
long long sumy[MAX];

long long oblicz(int a, int b)
{
    long long res = 0;

    for (int i = a; i <= b - k + 1; i++)
        if (sumy[i + k - 1] - sumy[i - 1] > 0)
            res = max(res, sumy[i + k - 1] - sumy[i - 1] + oblicz(i + k, b));

    return res;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> k >> q;

    for (int i = 1; i <= n; i++)
    {
        cin >> tab[i];
        sumy[i] = tab[i] + sumy[i - 1];
    }

    for (int i = 0; i < q; i++)
    {
        cin >> l >> r;
        cout << oblicz(l, r) << "\n";
    }

    return 0;
}