#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ins insert
#define mid ((start+end)/2)
using namespace std;
const int MOD=1e9+7;
const int INF=2e5+5;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
int n,m,q,ans,k;
int sz=0;
int cev=0;
int a[INF];
vector<int> v;
map<int,int> mp;
map<int,int> idx;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i];
cin>>q;
while(q--){
int x;
cin>>x;
if(x==2){
ans=0;
int l,r,m;
cin>>l>>r>>m;
for(int i=l;i<=r;i++){
int mes=min(i-l,r-i)+1;
ans+=mes*a[i];
}
cout<<ans<<endl;
}
else{
int b;
cin>>b;
//cout<<"a"<<endl;
continue;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |