| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19681 | 王循 | 最大和与最小和 | C++ | Wrong Answer | 50 | 0 MS | 252 KB | 303 | 2021-05-19 17:51:27 |
#include <bits/stdc++.h> using namespace std; int q[105],a; int n,minn=INT_MAX,maxn=-INT_MAX; int main() { cin>>n; for(int i=1;i<=n;i++)cin>>a,q[i]=q[i-1]+a; for(int i=1;i<=n;i++)for(int j=i;j<=n;j++)maxn=max(maxn,q[j]-q[i-1]),minn=min(minn,q[j]-q[i-1]); cout<<maxn<<endl<<minn<<endl; }