Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
45593 | jiabokai | 移动石子 | C++ | Accepted | 0 MS | 240 KB | 426 | 2024-04-16 20:51:19 |
#include<bits/stdc++.h> using namespace std; int a[200],b[100]; int main(){ int n,sum=0,cnt=0; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; sum+=a[i]; a[i+n]=a[i]; } cnt=sum/n; int max=100000; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ b[j]=a[i+j]; } int k=0; for(int j=0;j<n-1;j++){ k+=abs(b[j]-cnt); b[j+1]+=b[j]-cnt; b[j]=cnt; } max=min(max,k); } cout<<max; }