玲珑杯 1014 - Absolute Defeat

1014 - Absolute Defeat

Time Limit：2s Memory Limit：64MByte

Submissions：257Solved：73

DESCRIPTION

Eric has an array of integers $a_1,a_2,...,a_n$. Every time, he can choose a contiguous subsequence of length $k$ and increase every integer in the contiguous subsequence by $1$.He wants the minimum value of the array is at least $m$. Help him find the minimum number of operations needed.

INPUT

There are multiple test cases. The first line of input contains an integer$T$, indicating the number of test cases. For each test case:The first line contains three integers$n$,$m$ and $k$$(1\le n\le {10}^5,1\le k\le n,1\le m\le {10}^4)$.The second line contains $n$ integers $a_1,a_2,...,a_n$$(1\le a_i\le {10}^4)$.

OUTPUT

For each test case, output an integer denoting the minimum number of operations needed.

SAMPLE INPUT

32 2 21 15 1 41 2 3 4 54 10 31 2 3 4

SAMPLE OUTPUT

1015

【解题方法】思维。从左往右枚举每个元素, 如果不够的话, 直接把这个元素起始的长度为$m$的序列都改一下就好了.

【AC 代码】

//
//Created by just_sort 2016/9/25 21:03
//Copyright (c) 2016 just_sort.All Rights Reserved
//

#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
int a[1000010];
int main()
{
    int T,n,k,m;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1; i<=n; i++) scanf("%d",&a[i]);
        int ans = 0;
        int temp;
        for(int i=1; i<=n; i++){
            if(a[i]<m){
                temp = m - a[i];
                ans += temp;
                for(int j=i; j<i+k; j++){
                    a[j] += temp;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}