| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1296939 | dosts | Peru (RMI20_peru) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e18;
const int N = 1e5+1;
int add(int x,int y) {
if ((x + y) >= MOD) return x + y - MOD;
return x + y;
}
int mult(int x,int y) {
return (1LL * x * y) % MOD;
}
int expo(int x,int y) {
if (!y) return 1;
int e = expo(x, y >> 1);
e = mult(e, e);
if (y & 1) e = mult(e, x);
return e;
}
void solve() {
int n,k;
cin >> n >> k;
vi a(n+1);
for (int i=1;i<=n;i++) cin >> a[i];
vi dp(n+1,inf);
dp[0] = 0;
a[0] = inf;
deque<int> stk;
for (int i=0;i<=n;i++) {
while (!stk.empty() && a[stk.back()] <= a[i]) {
stk.pop_back();
}
stk.push_back(i);
for (int j = big(stk)-1;j>=0;j--) {
if (stk[j] >= i-k+1) {
dp[i] = min(dp[i],a[stk[j]]+(j?(dp[max(i-k,stk[j-1])]):0ll));
}
}
}
/* for (int i=1;i<=n;i++) cout << dp[i] << ' ';
cout << '\n'; */
int mlt = 1;
int ans = 0;
for (int i = n;i>=1;i--) {
ans = add(ans,mult(dp[i],mlt));
mlt = mult(mlt,23);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while (t --> 0) solve();
}