UESTC-4 Build Houses (贪心+差分)

Bear has a large, empty ground for him to build a home. He decides to build a row of houses, one after another, say nn in total.

The houses are designed with different height. Bear has mm workers in total, and the workers must work side by side. So at a time bear can choose some continuous houses, no more than mm, and add their heights by one, this takes one day to finish.

Given the designed height for each house, what is the minimum number of days after which all the houses’ heights are no less than the original design?

Standard Input

The first line of input contains a number TT, indicating the number of test cases. (Tleq 50T≤50)

For each case, the first line contains two integers nn and mm: the number of houses and the number of workers. The next line comes with nn non-negative numbers, they are the heights of the houses from left to right. (1leq n, mleq 100,0001≤n,m≤100,000, each number will be less than 1,000,000,0001,000,000,000)

Standard Output

For each case, output Case #i: first. (ii is the number of the test case, from 11 to TT). Then output the days when bear’s home can be built.

Samples

Input	Output
2 3 3 1 2 3 3 3 3 2 1	Case #1: 3 Case #2: 3

 

 

Problem ID	4
Problem Title	Complete Building the Houses
Time Limit	2000 ms
Memory Limit	64 MiB
Output Limit	64 MiB
Source	The 11th UESTC Programming Contest Final

这是一道贪心+差分的题目

贪心的思路是每次选择当前的最优策略，通过每一步的最优策略达到整体的最优。

特点是只考虑当下情况。

对于此题，既然每次最多能建的宽度是m，且建宽度1和建宽度m的花费是一样的，那么就一定每次建m。

现在考虑到通过最终的线性运算来实现一个区间的变换，所以用差分法。

看到洛谷上有一个评论：看到区间就想差分法。

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <iostream>
#include "algorithm"
using namespace std;
typedef long long LL;
const int MAX=100005;
LL t,n,m,a[MAX],b[MAX];
inline LL read(){
    LL an=0;char c;c=getchar();
    while (c<'0' || c>'9') c=getchar();
    while (c>='0' && c<='9') {an=an*10+c-'0';c=getchar();}
    return an;
}
int main(){
    freopen ("4.in","r",stdin);
    freopen ("4.out","w",stdout);
    LL i,j,k,ant,ans;
    scanf("%lld",&t);
    for (k=1;k<=t;k++){
        n=read(),m=read();
        for (i=1;i<=n;i++) a[i]=read();
        memset(b,0,sizeof(b));
        ans=0;
        for (i=1;i<=n;i++){
            b[i]+=b[i-1];
            if (b[i]<a[i]){
                ant=a[i]-b[i];
                ans+=ant;
                b[i]+=ant;
                if (i+m<=n) b[i+m]-=ant;
            }
        }
        printf("Case #%lld: %lld
",k,ans);
    }
    return 0;
}