Maximize The Beautiful Value

题目描述

Today HH finds a non-decreasing sequence(a1,a2…an,ai≤ai+1), he thinks it’s not beautiful so he wants to make it beautiful. To make it, HH will choose exactly one number and move it forward at least k steps(i.e. you can move ai to aj if k≤i−j), and then he defines the beautiful value F(n) as HH asks you to calculate max(F(n))
输入描述:
The first line contains an positive integer T(1≤T≤10), represents there are T test cases. For each test case: The first line contains two positive integers n,k(1≤n≤105,1≤k<n)，the length of the sequence ,the least steps you need to move. The second line contains n integers a1,a2…an(1≤ai≤108) - the sequence.
输出描述:
For each test case, you should output the max F(n).

输入
3
5 3
1 1 3 4 5
5 2
1 1 3 4 5
5 1
1 1 3 4 5
输出
46
50
53
说明

In the first example, you can move the fifth number 4 for 3 steps and make the sequence become [4,1,1,3,5], then the beautiful value is 4×1+1×2+1×3+3×4+5×5=46.You can also move the fifth number to make it become [1,5,1,3,4], the beautiful value is also 46.In the second example, you can move the fifth number 5 for 2 steps and make the sequence become [1,1,5,3,4]In the second example, you can move the second number 1 for 1 steps and then the sequence is still [1,1,3,4,5]
备注:
scanf is commended。

#include<iostream>

using namespace std;

typedef long long LL;

const int MAXM=1e5+10;

LL a[MAXM], pre[MAXM];

int main()
{
    int T;
    cin>>T;
    while(T--){
        int n,k;
        LL temp=0,sum=0;
        cin>>n>>k;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            sum+=a[i]*i;
        }
        for(int i=1;i<=n;i++)//前缀
            pre[i]=pre[i-1]+a[i];
        for(int i=k+1;i<=n;i++)
            temp=max(temp,sum-k*a[i]+(pre[i-1]-pre[i-k-1]));
        cout<<temp<<endl;

    }

    return 0;
}