玲珑学院-ACM比赛1014

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

源代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<deque>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cstdlib>
#include<cmath>
#include<sstream>
#include<ctime>
using namespace std;

typedef long long ll;
int ans[200005];

int main()
{
    int t;
    int n,m,k;
    int temp;
    ll sum;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        sum = 0;
        memset(ans,0x3f3f3f3f,sizeof(ans));
        for(int i = 0; i < n; i++)
            scanf("%d",&ans[i]);
        for(int i = 0; i < n; i++)
        {
            if(ans[i]<m)
            {
                temp=m-ans[i];
                sum+=temp;
                for(int j = i; j < i+k;j++)
                    ans[j]+=temp;
            }
        }
        printf("%lld
",sum);
    }
	return 0;
}