5 solutions
-
0
解题报告
撰写人: 钟世博
难度等级
★★★☆☆
参考程序
#include<bits/stdc++.h> using namespace std; int n,m,d; int main() { cin>>n>>m; int a[n+1],b[n+1]; b[0]=0; for(int i=1;i<=n;i++) { cin>>a[i]; b[i]=b[i-1]+a[i]; } for(int i=1;i<=m;i++) { int x,y; cin>>x>>y; if(x<=y) { int z=b[y]-b[x-1]; if(z>d) d=z; } else { int z=b[n]-b[x-1]+b[y]; if(z>d) d=z; } } cout<<d; return 0; }
Information
- ID
- 611
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 5
- Tags
- # Submissions
- 40
- Accepted
- 17
- Uploaded By