| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 32064 | 陶俊宸 | 最大和与最小和 | C++ | Accepted | 100 | 0 MS | 256 KB | 423 | 2022-02-09 13:36:17 |
#include<iostream> #include<math.h> short n,num[100],bn[101],maxn=-10000,minn=10000; int main(){ scanf("%hd",&n); for(short i=0;i<n;i++){ scanf("%hd",&num[i]); bn[i]=i?bn[i-1]+num[i-1]:0; } bn[n]=bn[n-1]+num[n-1]; for(short i=0;i<n;i++){ for(short j=i+1;j<=n;j++){ short sum=bn[j]-bn[i]; if(sum>maxn) maxn=sum; if(sum<minn) minn=sum; } } printf("%hd\n%hd",maxn,minn); return 0; }