| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 31821 | 陈万瑄 | 最大和与最小和 | C++ | Wrong Answer | 50 | 0 MS | 248 KB | 366 | 2022-02-08 17:27:10 |
#include<bits/stdc++.h> using namespace std; int n,t[101],maxn=-1<<30,minn=1<<30; //int li_si_xian_ri_shan_ben int main(){ cin>>n; for(int i=1;i<=n;i++){ int a; cin>>a; t[i]=t[i-1]+a; } for(int i=0;i<n;i++){ for(int j=i+1;j<=n;j++){ maxn=max(maxn,t[j]-t[i]); minn=min(minn,t[j]-t[i]); } } cout<<maxn<<endl<<minn; return 0; }