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
43
44
45
46
47
48
49
50
//Autor: Piotr Zielinski
#include<bits/stdc++.h>
using namespace std;

template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;}
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(X) (X).begin(), (X).end()
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;


int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k, q, l, r;
    cin >> n >> k >> q;

    vector<ll> a(n);
    vector<ll> prefSum(n + 1);
    vector<ll> dp(n + 1);

    for(int i = 0;i < n;++i) {
        cin >> a[i];
        prefSum[i + 1] = prefSum[i] + a[i];
    }

    while (q --> 0) {
        cin >> l >> r;

        if(r - l + 1 < k) {
            cout << "0\n";
            continue;
        }

        for(int i = 0;i < k - 1;++i)
            dp[l + i] = 0;
        dp[l + k - 1] = max(0LL, prefSum[l + k - 1] - prefSum[l - 1]);

        for(int i = l + k;i <= r;++i) {
            dp[i] = max(dp[i - 1], dp[i - k] + prefSum[i] - prefSum[i - k]);
        }

        cout << dp[r] << "\n";
    }

    return 0;
}