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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,k,q;
    cin>>n>>k>>q;
    int tab[n+1];
    tab[0] = 0;
    ll prefix[n+1];
    prefix[0] = 0;
    for(int i=1;i<=n;i++) {
        cin>>tab[i];
        prefix[i] = prefix[i-1] + tab[i];
    }
    ll wyn[n+1];
    for(int i=0;i<q;i++) {
        int a,b;
        cin>>a>>b;
        wyn[a-1] = 0;
        int dl = b-a+1;
        for(int j=0;j<dl;j++) {
            wyn[a+j] = wyn[a+j-1];
            if(j >= k-1) {
                wyn[a+j] = max(wyn[a+j],wyn[a+j-k]+prefix[a+j]-prefix[a+j-k]);
            }
        }
        cout<<wyn[b]<<'\n';
    }
}