Codeforces 940E. Cashback（贪心 + dp）

E. Cashback

Since you are the best Wraith King, Nizhniy Magazin «Mir» at the centre of Vinnytsia is offering you a discount.

You are given an array a of length n and an integer c.

The value of some array b of length k is the sum of its elements except for the $\lfloor \frac{k}{c}\rfloor$ smallest. For example, the value of the array [3, 1, 6, 5, 2] with c = 2 is 3 + 6 + 5 = 14.

Among all possible partitions of a into contiguous subarrays output the smallest possible sum of the values of these subarrays.

Input

The first line contains integers n and c (1 ≤ n, c ≤ 100 000).

The second line contains n integers ai (1 ≤ ai ≤ 109) — elements of a.

Output

Output a single integer — the smallest possible sum of values of these subarrays of some partition of a.

Examples

input
3 5
1 2 3
output
6
input
12 10
1 1 10 10 10 10 10 10 9 10 10 10
output
92
input
7 2
2 3 6 4 5 7 1
output
17
input
8 4
1 3 4 5 5 3 4 1
output
23
Note

In the first example any partition yields 6 as the sum.

In the second example one of the optimal partitions is [1, 1], [10, 10, 10, 10, 10, 10, 9, 10, 10, 10] with the values 2 and 90 respectively.

In the third example one of the optimal partitions is [2, 3], [6, 4, 5, 7], [1] with the values 3, 13 and 1 respectively.

In the fourth example one of the optimal partitions is [1], [3, 4, 5, 5, 3, 4], [1] with the values 1, 21 and 1 respectively.

题意： 给你一个长度为n的数列a和整数c你需要把它任意分段。每一段假设长度为k，就去掉$\lfloor \frac{k}{c}\rfloor$小的数。最小化剩下的数的。

思路： 贪心会发现，最优的时候，一个段的长度要么为 c ，要么为1，那么有dp[i]表示到第 i 个数的最小和。dp[i] 可由 dp[i - 1] 和 dp[i - c] 转移。

Code：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fi first
#define se second
#define ptch putchar
#define CLR(a) while(!(a).empty()) a.pop()

using namespace std;
inline LL read() {
    LL s = 0,w = 1;
    char ch = getchar();
    while(!isdigit(ch)) {
        if(ch == '-') w = -1;
        ch = getchar();
    }
    while(isdigit(ch))
        s = s * 10 + ch - '0',ch = getchar();
    return s * w;
}
inline void write(LL x) {
    if(x < 0)
        putchar('-'), x = -x;
    if(x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}

const int maxn = 1e5 + 10;
const LL inf = 0x7f7f7f7f7f7f7f7f;
LL dp[maxn],a[maxn],pre[maxn];
LL st[maxn][20];
int n,c;

void st_init(){
    rep(i,1,n + 1) st[i][0] = a[i];
    for(int j = 1;(1 << j) <= n;++ j)
        for(int i = 1;i + (1 << j) - 1 <= n;++ i)
            st[i][j] = min(st[i][j - 1],st[i + (1 << j - 1)][j - 1]);
}

LL RMQ(int l,int r){
    int k = 0;
    while(1 << (k + 1) <= r - l + 1) ++ k;
    return min(st[l][k],st[r - (1 << k) + 1][k]);
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    while(~scanf("%d%d",&n,&c)){
        rep(i,1,n + 1) a[i] = read(),pre[i] = pre[i - 1] + a[i];
        st_init();
        clr(dp,inf); dp[0] = 0;
        for(int i = 1;i <= n;++ i){
            dp[i] = min(dp[i],dp[i - 1] + a[i]);
            if(i >= c)
                dp[i] = min(dp[i],dp[i - c] + pre[i] - pre[i - c] - RMQ(i - c + 1,i));
        }
        write(dp[n]); ptch('\n');
    }
    return 0;
}