一维前缀和序列

 

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>

vector <int>a;
vector <int>b;
long long s1[100010];
long long s2[100010];

int main(){
	
	int n;
	cin >> n;
	a.push_back(0);
	b.push_back(0);
	for(int i=1;i<=n;i++){
		int x;
		cin >> x;
		a.push_back(x);
		b.push_back(x);
	}
	sort(b.begin(),b.end());
	s1[0]=0;
	s2[0]=0;
	for(int i=1;i<=n;i++){
		s1[i]=s1[i-1]+a[i]; //一维前缀和公式
		s2[i]=s2[i-1]+b[i];
	}
	int m;
	cin >> m;
	
	while(m--){
		int q,l,r;
		cin >> q >> l >>r;
		if(q==1){
			cout << s1[r]-s1[l-1]<<endl;//根据前缀和求l到r的和
		}
		else{
			cout << s2[r]-s2[l-1]<<endl;
		}
	}
}