| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 31688 | Andrew宥杨 | 区间求和 | C++ | Wrong Answer | 0 MS | 248 KB | 292 | 2023-11-21 21:10:05 |
#include<bits/stdc++.h> using namespace std; #define MAXN int(1e5+5) int a[MAXN]={}; int main(){ int n,n2,sum=0; cin>>n>>n2; for(int i=1;i<=n;i++) cin>>a[i]; while(n2){ int c,b; cin>>c>>b; for(int i=c;i<=b;i++) sum+=a[i]; cout<<sum<<endl; n2--; } return 0; }