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

int main(){
	int n, k ,q;
	cin >> n >> k >> q;
	long long a[n];
	long long c[n+1];
	c[n]=0;
	for(int i = 0 ; i<n; i++){
		cin >> a[i];
	}
	for(int i = n-1; i >= 0; i--){
		c[i]=c[i+1]+a[i];
		if(i<n-k){
			c[i]-=a[i+k];
		}
	}
	for(int  i =0 ; i < q; i++){
		int l, r;
		cin >> l >> r;
		if(r-l+1<k){
			cout << 0 << '\n';
			continue;
		}
		int s = r-l+1;
		long long b[s-k+1];
		b[s-k]=c[r-k];
		b[s-k]=max(b[s-k]-b[s-k], b[s-k]);
		//cout << b[s-k] << '\n';
		for(int i = s-k-1; i >=0; i--){
		//	cout << i << ' ' << i+l << ' ';
			if(i<=s-k*2){
				b[i]=max(b[i+1], b[i+k]+c[i+l-1]);
			}else{ 
				b[i]=max(b[i+1], c[i+l-1]);
			}
			b[i]=max(b[i]-b[i], b[i]);
		//	cout << b[i]  << ' ' << c[i+l-1]<< '\n';
		}
		cout << b[0] << '\n';
	}
	return 0;
}