# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443095 | BeanZ | K blocks (IZhO14_blocks) | C++14 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// I_Love_LPL 1y0m1d
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
long long mod = 1000007;
const int lim = 4e5 + 5;
const int lg = 20;
const int base = 311;
const long double eps = 1e-6;
ll dp[N][105], a[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("tests.inp", "r")){
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
for (int i = 1; i <= n; i++){
dp[i][1] = a[i];
}
for (int j = 2; j <= k; j++){
vector<pair<ll, ll>> mem;
for (int i = j; i <= n; i++){
ll v = dp[i - 1][j - 1];
while (mem.size() && a[i] >= mem.back().first){
if (v > mem.back().second) v = mem.back().second;
mem.pop_back();
}
if (!mem.size() || (v + a[i]) < (mem.back().first + mem.back().second)) mem.push_back({a[i], v});
dp[i][j] = mem.back().first + mem.back().second;
}
}
cout << dp[n][k];
}
/*
Ans:
Out:
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |