Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int n,t1=1,t2=2;
- cin>>n;
- vector<int>v(n+1);
- v[0]=0;
- for(int i=1;i<n+1;i++){
- cin>>v[i];
- }
- ll prefix[n+2]{};
- if(t1){
- for(int i=1;i<v.size()+1;i++){
- prefix[i]=v[i]+prefix[i-1];
- }
- }else if(t2){
- sort(all(v));
- for(int i=1;i<v.size()+1;i++){
- prefix[i]=v[i]+prefix[i-1];
- }
- }
- int q;
- cin>>q;
- while(q--){
- int t,l,r;
- cin>>t>>l>>r;
- if(t==t1){
- cout<<prefix[r]-prefix[l-1]<<"\n";
- }else if(t==t2){
- cout<<prefix[r]-prefix[l-1]<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement