Python3(3.9) 解法, 执行用时: 17ms, 内存消耗: 2848K, 提交时间: 2020-12-20 04:22:16

import sys

n = int(input())
arr = [0] * n
for i in range(n):
    arr[i] = int(input())

found = False
to_fill = to_be_filled = 0
for i in range(n):
    to_be_filled += 1
    to_fill += arr[i]
    if to_be_filled > to_fill:
        start = i + 1
        to_fill = to_be_filled = 0
        found = True

if not found:
    print(0)
    sys.exit()

arr += arr
total = 0
to_be_filled = 0
for i in range(start+n-1, start-1, -1):
    num = arr[i]
    if num > 0:
        for _ in range(num):
            total += to_be_filled ** 2
            to_be_filled -= 1
    to_be_filled += 1

print(total)

C++11(clang++ 3.9) 解法, 执行用时: 12ms, 内存消耗: 480K, 提交时间: 2020-02-26 23:52:40

#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int  n,i,s,l,x=1,t=1,w=0,a[N],g[N];
long long ans;
int main()
{
	cin>>n;
	for(i=1;i<=n;++i)
	{
		cin>>a[i];
		a[n+i]=a[i];
	}
	for(i=1;i<=2*n-1;++i)
	{
		if(s<0)
		s=0,x=i;
		s+=a[i]-1;
		if(s>ans)
		ans=s,l=x;
	}
	ans=0;
	for(i=l;i<=l+n-1;++i)
	{
		while(a[i]--)
		g[++w]=i;
		ans+=1LL*(i-g[t])*(i-g[t]);
		t++;
	}
	cout<<ans;
	return 0;
}

C++14(g++5.4) 解法, 执行用时: 9ms, 内存消耗: 376K, 提交时间: 2019-06-29 11:39:51

#include<stdio.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
int n,a[1100],at,x,te,ans;
int main(){
	ans=0x7fffffff;
	scanf("%d",&n);
	fo(i,0,n-1){
		scanf("%d",&x);
		fo(j,1,x) a[at++]=i;
	}
	fo(st,0,n-1){
		te=0;
		fo(i,0,n-1){
			x=(st+i-a[i])%n;
			if (x<0) x+=n;
			te+=x*x;
		}
		if (te<ans) ans=te;
	}
	printf("%d\n",ans);
	return 0;
}