#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
const int N=3e5+5;
int a[N];
signed main(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int q;
cin>>q;
while(q--){
int t;
cin>>t;
if(t==1){
int x;
for(int i=1;i<=k;i++)cin>>x;
}
else{
int l,r,m;
cin>>l>>r>>m;
deque<int>dq;
int s=0;
int h=0;
for(int i=l;i<=r;i++){
dq.push_back(a[i]);
h+=a[i];
if(dq.size()>m){
h-=dq.front();
dq.pop_front();
}
if(dq.size()==m)s+=h;
}
cout<<s<<endl;;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |