废话一句不多说，代码给你台上“车” 这个题实在是太简单啦！

#include <iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int a[100001]; int s[100001]; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ s[i]=s[i-1]+a[i]; } for(int i=1;i<=m;i++){ int l,r; cin>>l>>r; cout<<s[r]-s[l-1]<<endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int a[1000005];//数据 int s[1000005];//前缀和 int main(){ int n,m; cin>>n>>m; for(int i=1;i<=n;i++){ cin>>a[i]; s[i]=s[i-1]+a[i];//生成前缀和数组 } while(m--){//m次询问 int l,r; cin>>l>>r;//输出区间和[l,r] cout<<s[r]-s[l-1]<<endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int n,m; const int N = 1e5 + 10; int a[N],s[N]; int main() { cin >> n >> m; for (int i = 1; i <= n; i ++ ) cin >> a[i]; for (int i = 1; i <= n; i ++ ) s[i] = s[i - 1] + a[i]; while (m -- ) { int l,r; cin >> l >> r; cout << s[r] - s[l - 1] << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N=100001; int n,m,a[N],s[N],l,r; int main(){ cin>>n>>m; for(int i=1;i<=n;i++) { cin>>a[i]; s[i]=s[i-1]+a[i]; } for(int i=1;i<=m;i++) { cin>>l>>r; cout<<s[r]-s[l-1]<<endl; } return 0; }