| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 31692 | 老师 | 最大和与最小和 | C++ | Accepted | 100 | 0 MS | 252 KB | 372 | 2022-02-08 16:20:29 |
#include<bits/stdc++.h> using namespace std; const int N=110; int n,a[N],maxn=-1e8,minn=1e8; void sum(int x,int y){ int t=0; for(int i=x;i<=y;i++) t+=a[i]; maxn=max(maxn,t); minn=min(minn,t); } int main(){ cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++){ for(int j=i;j<=n;j++) sum(i,j); } cout<<maxn<<endl<<minn; return 0; }