Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
31760 | jiabokai | 区间求和 | C++ | Accepted | 0 MS | 264 KB | 288 | 2023-11-23 20:47:58 |
#include<iostream> #define maxn (int)1e5+5 using namespace std; int a[maxn],b[maxn]; int n,m; int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ cin>>a[i]; b[i]=b[i-1]+a[i]; } for(int i=0;i<m;i++){ int l,r; cin>>l>>r; cout<<b[r]-b[l-1]<<"\n"; } return 0; }