| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19585 | 季洁 | 最大和与最小和 | C++ | Wrong Answer | 10 | 0 MS | 256 KB | 356 | 2021-05-16 20:19:17 |
#include<bits/stdc++.h> using namespace std; int a[101],n,maxn,minn=101,sum; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]<minn) minn=a[i]; } for(int i=1;i<=n;i++){ for(int j=1;j<=n-i+1;j++){ sum=0; for(int k=j;k<=j+i-1;k++){ sum+=a[k]; } if(sum>=maxn) maxn=sum; } } cout<<maxn<<' '<<minn; }