| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 20010 | 陈路垚 | 最大和与最小和 | C++ | Accepted | 100 | 0 MS | 252 KB | 379 | 2021-05-27 21:46:18 |
#include<bits/stdc++.h> using namespace std; int num[101]; int main() { int n,i,j; cin>>n; for(i=0;i<n;i++) cin>>num[i]; int x,y,mi=9999,ma=-9999,sum=0; for(i=0;i<n;i++){ sum=num[i]; if(sum>ma)ma=sum; if(sum<mi)mi=sum; for(j=i+1;j<n;j++){ sum+=num[j]; if(sum>ma)ma=sum; if(sum<mi)mi=sum; } } cout<<ma<<endl<<mi<<endl; return 0; }