Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
49175 | 海码哥 | 202406BCSP-X-初中组04 | C++ | Wrong Answer | 0 MS | 252 KB | 471 | 2024-06-26 11:59:31 |
#include<bits/stdc++.h> using namespace std; struct number { int mn=1e9; int res=0; }; int main() { number ccc; int n,k,arr[60]={}; cin>>n>>k; for(int i=0;i<n;i++) cin>>arr[i]; int mn=1e9,ans=0; for(int i=0;i<n;i++) { for(int j=i;j<n;j++) { ans=0; for(int k=i;k<=j;k++) ans+=arr[k]; if(max(ans,k)-min(ans,k)<ccc.mn) { ccc.mn=max(ans,k)-min(ans,k); ccc.res=ans; } } } cout<<ccc.res; return 0; }