题目链接:https://vjudge.net/problem/HDU-5933
题解:因为拆分合并只需要考虑相邻的区域就好,所以不够就合并,多了就拆分。
#include<bits/stdc++.h>
#define maxn 100010
#define ll long long
using namespace std;
int main()
{
int T;
scanf("%d",&T);
int cas=1;
while(T--)
{
int n,k;
ll a[maxn];
scanf("%d%d",&n,&k);
ll tmp=0;
for(int i=0;i<n;i++)
{
scanf("%lld",&a[i]);
tmp+=a[i];
}
printf("Case #%d: ",cas++);
if(tmp%k!=0)
{
printf("-1\n");
continue;
}
tmp=tmp/k;
int ans=0;
for(int i=0;i<n;i++)
{
if(a[i]==tmp)
continue;
if(a[i]<tmp)
{
ll t=a[i];
int j=i+1;
while(1)
{
if(t+a[j]>tmp||j==n)
break;
else
{
t+=a[j];
j++;
ans++;
}
}
i=j-1;
if(t<tmp)
{
a[i+1]-=tmp-t;
ans+=2;
}
}
else if(a[i]>tmp)
{
ll t=a[i];
while(t>tmp)
{
ans++;
t-=tmp;
}
a[i]=t;
i--;
}
}
printf("%d\n",ans);
}
return 0;
}