#include <bits/stdc++.h> #define ll long long int using namespace std; const int maxn=3*1e5+5; int n, k, q; ll a[maxn]; ll f(int l, int r) { if(r-l+1<k) return 0; ll sum=0, wyn=0; for(int i=l; i<=l+k-1; ++i) sum+=a[i]; for(int i=l; i<=r-k+1; ++i) { if(sum>=0) wyn=max(wyn, f(i+k, r)+sum); sum-=a[i]; sum+=a[i+k]; } return wyn; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n>>k>>q; for(int i=1; i<=n; ++i) cin>>a[i]; for(int qq=1; qq<=q; ++qq) { int l, r; cin>>l>>r; cout<<f(l, r)<<"\n"; } return 0; }
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 | #include <bits/stdc++.h> #define ll long long int using namespace std; const int maxn=3*1e5+5; int n, k, q; ll a[maxn]; ll f(int l, int r) { if(r-l+1<k) return 0; ll sum=0, wyn=0; for(int i=l; i<=l+k-1; ++i) sum+=a[i]; for(int i=l; i<=r-k+1; ++i) { if(sum>=0) wyn=max(wyn, f(i+k, r)+sum); sum-=a[i]; sum+=a[i+k]; } return wyn; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n>>k>>q; for(int i=1; i<=n; ++i) cin>>a[i]; for(int qq=1; qq<=q; ++qq) { int l, r; cin>>l>>r; cout<<f(l, r)<<"\n"; } return 0; } |