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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define debug std::cout << "hmm" << std::endl;
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::vector<int> vi;
typedef std::vector<ll> vl;

template <typename T>
void print(const T &t)
{
    std::cout << t << ' ';
}
template <typename T1, typename T2>
void print(const std::pair<T1, T2> &t)
{
    std::cout << '{';
    print(t.first);
    print(t.second);
    std::cout << '}';
}
template <typename T>
void print(const std::vector<T> &t)
{
    for (auto a : t)
        print(a);
    std::cout << std::endl;
}

main()
{
    std::cin.tie(0)->sync_with_stdio(0);
    std::cin.exceptions(std::cin.failbit);

    int Z = 1;
    //std::cin >> Z;
    while (Z--)
    {
        ll n, k, q;
        std::cin >> n >> k >> q;
        vl V(n);
        for (auto &a : V)
            std::cin >> a;
        vl S(n + 1, 0);
        for (int i = 0; i < n; i++)
            S[i + 1] = S[i] + V[i];
        vl L(n + 1, 0);
        std::vector<std::pair<pll, int>> IN(q);
        for (int i = 0; i < q; i++)
        {
            IN[i].second = i;
            std::cin >> IN[i].first.first >> IN[i].first.second;
        }
        std::sort(all(IN));
        std::vector<pll> ANS(q);
        for (int i = k + IN[0].first.first - 1; i <= IN[0].first.second; i++)
            L[i] = std::max(L[i - 1], L[i - k] + S[i] - S[i - k]);
        ANS[0] = {IN[0].second, L[IN[0].first.second]};
        for (int i = 1; i < q; i++)
        {
            //print(L);
            if (IN[i].first.first == IN[i - 1].first.first)
                for (int j = std::max(IN[i - 1].first.second, k + IN[i].first.first - 1); j <= IN[i].first.second; j++)
                    L[j] = std::max(L[j - 1], L[j - k] + S[j] - S[j - k]);
            else
            {
                //std::cout << IN[i].first.first << std::endl;
                L = vl(n + 1, 0);
                for (int j = k + IN[i].first.first - 1; j <= IN[i].first.second; j++)
                    L[j] = std::max(L[j - 1], L[j - k] + S[j] - S[j - k]);
            }
            ANS[i] = {IN[i].second, L[IN[i].first.second]};
        }
        std::sort(all(ANS));
        for (auto &a : ANS)
            std::cout << a.second << std::endl;
    }
}