#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
const int MX = 100005;
const int MOD = (int) (1e9 + 7);
const int INF = 987654321;
namespace output {
void pr(int x) {
cout << x;
}
void pr(long x) {
cout << x;
}
void pr(ll x) {
cout << x;
}
void pr(unsigned x) {
cout << x;
}
void pr(unsigned long x) {
cout << x;
}
void pr(unsigned long long x) {
cout << x;
}
void pr(float x) {
cout << x;
}
void pr(double x) {
cout << x;
}
void pr(long double x) {
cout << x;
}
void pr(char x) {
cout << x;
}
void pr(const char * x) {
cout << x;
}
void pr(const string & x) {
cout << x;
}
void pr(bool x) {
pr(x ? "true" : "false");
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
template < class T > void pr(const T & x);
template < class T, class...Ts > void pr(const T & t,
const Ts & ...ts) {
pr(t);
pr(ts...);
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
pr("{", x.f, ", ", x.s, "}");
}
template < class T > void pr(const T & x) {
pr("{"); // const iterator needed for vector<bool>
bool fst = 1;
for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
pr("}");
}
void ps() {
pr("\n");
} // print w/ spaces
template < class T, class...Ts > void ps(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(" ");
ps(ts...);
}
void pc() {
cout << "]" << endl;
} // debug w/ commas
template < class T, class...Ts > void pc(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(", ");
pc(ts...);
}
#define dbg(x...) pr("[", #x, "] = ["), pc(x);
}
#ifndef ONLINE_JUDGE
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif
int dp[MX][101];
struct Node {
int val;
};
template<int SZ> struct Seg {
Node tree[4*SZ];
Node merge(Node a, Node b){
if (a.val < b.val) return a;
return b;
}
void build(int v, int l, int r, int d) {
if (l == r) {
tree[v].val = dp[l][d];
} else {
int m = (l + r) / 2;
build(2 * v + 1, l, m, d);
build(2 * v + 2, m + 1, r, d);
tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
}
}
Node query(int v, int l, int r, int ql, int qr) {
if (l > qr || r < ql) {
Node init;
init.val = INF;
return init;
} else if (l >= ql && r <= qr) {
return tree[v];
} else {
int m = (l + r) / 2;
Node a = query(2 * v + 1, l, m, ql, qr);
Node b = query(2 * v + 2, m + 1, r, ql, qr);
return merge(a, b);
}
}
};
Seg<MX> orz;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, k; cin >> n >> k;
vi a(n + 1), lft(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
stack<pi> stk;
for (int i = 1; i <= n; i++) {
while (!stk.empty() && stk.top().f <= a[i]) {
stk.pop();
}
lft[i] = (stk.empty() ? -1 : stk.top().s);
stk.push(mp(a[i], i));
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
dp[i][j] = INF;
}
}
dp[0][0] = 0;
for (int j = 0; j <= k; j++) {
for (int i = 1; i <= n; i++) {
if (lft[i] != -1) dp[i][j] = min(dp[i][j], dp[lft[i]][j]);
// if (j) dp[i][j] = min(dp[i][j], orz.query(0, 0, n, lft[i], i - 1).val + a[i]);
int lo = lft[i], hi = i - 1;
int best = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
if (dp[mid][j - 1] != INF) {
best = mid;
hi = mid - 1;
} else {
lo = mid + 1;
}
}
if (j) dp[i][j] = min(dp[i][j], dp[best][j - 1] + a[i]);
}
// for (int i = 0; i <= n; i++) cout << dp[i][j] << " ";
// cout << '\n';
/*
orz.build(0, 0, n, j);
*/
}
cout << dp[n][k] << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
