Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
45598 | WZH | 移动石子 | C++ | Compile Error | 0 MS | 0 KB | 441 | 2024-04-16 20:54:46 |
#include<bits/stdc++.h> using amespace std; int a[120],b[120]; int main() { int n,s1=0,v=0; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; s1+=a[i]; a[i+n]=a[i]; } v=s1/n; int maxc=5000; for(int i=0;i<=n;i++){ for(int j=0;j<n;j++){ b[j]=a[i+j]; } int c=0; for(int j=0;j<n-1;j++){ c+-abs(b[j]-avg); b[j+1]+=b[j]-avg; b[j]=avg; } maxc=min(maxc,c); } cout<<maxc<<endl; return 0; }