代码

#include<bits/stdc++.h>
using namespace std;
const int SIZE=1e5+3;
int d[SIZE],n,sum,tot,ans,not0,le;
inline int ask(int x)
{
	return d[x]-le;
}
int main()
{
ios::sync_with_stdio(false);
	cin>>n;
	not0=n;
	for(int i=1;i<=n;i++)
	{
		cin>>d[i];
		if(d[i]==0) not0--;
		sum+=d[i];
	}
	while(tot<sum)
	{
		int mi=0x3f3f3f3f;
		bool yes=false;
		int cnta=0;
		not0=n;
		for(int i=1;i<=n;i++)
		{
		//	printf("Find Lastl=%d Lastr=%d || Nowl=%d Nowr=%d(YES?%d)\n",lastl,lastr,l,r,yes);
			int idx=ask(i);
			if(idx<=0)
			{
				not0--;
				yes=false;
				continue;
			}
			else
			{
				if(!yes) yes=true,cnta++;
				mi=min(mi,idx);
			} 
		}
		le+=mi;
		tot+=not0*mi;
		ans+=mi*cnta;
	}
	cout<<ans;
}

评测结果