Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
45119 | C++|刘一阳 | 区间求和 | C++ | Wrong Answer | 0 MS | 260 KB | 339 | 2024-04-09 21:15:28 |
#include<iostream> using namespace std; const int MAXN=1e5+5; 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=1;i<=n;i++){ cout<<b[i]<<" "; } cout<<endl; while(m--){ int l,r; cin>>l>>r; cout<<b[r]-b[l-1]<<endl; } return 0; }