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
#include <stdio.h>

#define scan(args...) [&]{ return scanf(args); }();

long long max(long long a, long long b)
{
    if (a > b) return a;
    return b;
}

const int max_size = 3e5;

int main()
{
    int n, k, q;
    int a[max_size];
    long long s[max_size];
    long long *d = new long long[max_size+1]; d++;
    
    scan("%d%d%d", &n, &k, &q);
    
    for (int i = 0; i < n; i++)
        scan("%d", &a[i]);
    
    long long sum = 0;
    for (int i = 0; i < k; i++)
    {
        s[i] = 0;
        sum += a[i];
    }
    s[k-1] = sum;
    for (int i = k; i < n; i++)
    {
        s[i] = s[i-1] + a[i] - a[i-k];
    }
    
    while (q--)
    {
        int l, r;
        
        scan("%d%d", &l, &r);
        
        l--; r--;
        if (r - l + 1 < k)
            printf("0\n");
        else
        {
            for (int i = -1; i < k-1; i++)
                d[l + i] = 0;
            for (int i = l + k - 1; i <= r; i++)
                d[i] = max(d[i-1], d[i-k] + s[i]);
            printf("%lld\n", d[r]);
        }
    }
    
    return 0;
}