SPOJ Cumulative Sum Query

#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int i,j,k,l,t,n,q,s[100005],a,b;
vector<long long int>v;
cin>>t;
for(i=1;i<=t;i++)
{
cin>>n;
v.push_back(n);
}
s[0]=0;
for(i=1;i<=t;i++)
{
s[i]=s[i-1]+v[i-1];
}
cin>>q;
for(j=1;j<=q;j++)
{
cin>>a>>b;
a++;
b++;
cout<<s[b]-s[a-1]<<endl;

}

return 0;

}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here