| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19697 | 桑迪 | 最大和与最小和 | C++ | Accepted | 100 | 0 MS | 284 KB | 371 | 2021-05-20 08:40:11 |
#include<bits/stdc++.h> using namespace std; int xl[101],pl[5100],maxn=-10001,minn=1<<15,g,n; int main(){ cin>>n; for(int i=1;i<=n;i++) cin>>xl[i]; for(int i=1;i<=n;i++){ for(int j=i;j<=n;j++){ g++; for(int k=i;k<=j;k++) pl[g]+=xl[k]; } } for(int i=1;i<=g;i++) maxn=max(maxn,pl[i]),minn=min(minn,pl[i]); cout<<maxn<<endl<<minn; return 0; }