Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
45595 | Songgy_King | 移动石子 | C++ | Accepted | 1 MS | 248 KB | 447 | 2024-04-16 20:53:15 |
#include<bits/stdc++.h> using namespace std; int a[120],b[51],m; int main() { int n,suml=0,avg=0; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; suml+=a[i]; a[i+n]=a[i]; } avg=suml/n; int maxc=50000; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ b[j]=a[i+j]; } int cnt=0; for(int j=0;j<n-1;j++){ cnt+=abs(b[j]-avg); b[j+1]+=b[j]-avg; } maxc=min(maxc,cnt); } cout<<maxc<<endl; return 0; }