HDU 5933 ArcSoft's Office Rearrangement

贪心：

考虑第一个数字，如果它比平均数少，那么只能由它右边相邻的那个提供，如果它比平均数多，也只能通过右边的分出去。所以只要从左到右贪心一遍即可

【代码】

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;

#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define   mem(x,v)      memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}


LL a[100005];



int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //ios::sync_with_stdio(0);
    //cin.tie(0);
    int t;
    t = read();
    int cas = 1;
    while(t--)
    {
        LL n,k;
        scanf("%I64d%I64d",&n,&k);

        LL sum = 0;
        for(int i=1;i<=n;i++) scanf("%I64d",&a[i]), sum += a[i];
        if(sum%k!=0)
        {
            printf("Case #%d: -1\n",cas++);
            continue;
        }
        LL ans=0;
        LL avg = sum / k;
        for(int i=1;i<=n;i++)
        {
            if(a[i]<avg){
                if(a[i]+a[i+1]<=avg){
                    ans++;
                    a[i+1]=a[i]+a[i+1];
                }
                else
                {
                    a[i+1]=a[i+1]-avg+a[i];
                    ans+=2;
                }
            }
            else if(a[i]>avg)
            {
                int l=a[i]/avg;
                int m=a[i]%avg;
                if(m!=0) {
                    a[i+1]+=m;
                    ans+=2;
                }
                ans+=l-1;
            }
        }
        printf("Case #%d: %I64d\n",cas++,ans);
    }


    return 0;
}