AcWing795:前缀和

前缀和

题目

思路

代码

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




int main() {
	int n, m;
	cin >> n >> m;
	vector<int> array(n,0);
	for (int i = 0; i < n; i++) {
		cin >> array[i];
	}

	vector<int> Sum(n,0);
	//计算前count项和
	Sum[0] = array[0];
	for (int count = 1; count < n; count++) {
		Sum[count] = Sum[count - 1]+ array[count];
	}

	vector<vector<int>> query(m, vector<int>(2, 0));
	for (int j = 0; j < m; j++) {
		cin>>query[j][0]>>query[j][1];
	}
	
	
	for (int k = 0; k < m; k++) {
		cout<< Sum[query[k][1] - 1] - (query[k][0] > 1 ? Sum[query[k][0] - 2] : 0) <<endl;
	}
	
	return 0;
}