This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
const int INF = 1e9;
const int MAXN = 100;
int dp[MAXN + 1][MAXN + 1];
int arr[MAXN + 1];
int stk[MAXN + 1];
int mx[MAXN + 1];
int main() {
//ifstream cin("A.in");
//ofstream cout("A.out");
int i, j, n, k;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for(i = 1; i <= n; i++) {
cin >> arr[i];
}
for(i = 1; i <= n; i++) {
dp[i][1] = max(dp[i - 1][1], arr[i]);
}
for(j = 2; j <= k; j++) {
int sz = 0;
dp[0][j] = mx[0] = INF;
for(i = 1; i <= n; i++) {
while(sz > 0 && arr[i] >= arr[stk[sz]]) {
sz--;
}
stk[++sz] = i;
mx[sz] = min(mx[sz - 1], arr[i] + dp[stk[sz - 1] + 1][j - 1]);
dp[i][j] = mx[sz];
}
}
cout << dp[n][k];
//cin.close();
//cout.close();
return 0;
}
# | 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... |