#include #include #include #include #include #include #define ll long long using namespace std; ll ans[1001][1001];ll c[1001]; ll n,k; ll dp(ll i,ll j){ if(i>=n-1) return 0LL; if(j+k0) return ans[i][j]; ll q; if(j+k==i) q=c[i]+dp(i+k+1,i+k); else q=min(c[i]+dp(i+k+1,i+k),dp(i+1,i-1)); ans[i][j]=q; return q; } int main() { memset(ans,-1,sizeof ans); cin>>n>>k; for(ll i=0;i>c[i]; } ll res=dp(0LL,-1LL); cout<