oj.uz

Submission #345832

# Submission time Handle Problem Language Result Execution time Memory
345832 2021-01-08T09:12:05 Z acm K blocks (IZhO14_blocks) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
int n, k, a[100005], l[100005], dp[105][100005];
vector<int> v;
int get(int m, int L, int R) {
  int h = 1e9;
  for (int i = L; i <= R; i++) h = min(h, dp[m][i]);
  return h;
}
void calc(int m) {
  for (int i = 2; i <= k; i++) {
    dp[i][m] = get(i - 1, l[m], m - 1) + a[m];
  }
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (i > 1)
      dp[1][i] = max(dp[1][i - 1], a[i]);
    else
      dp[1][i] = a[i];
  }
  for (int i = 1; i <= n; i++) {
    while (sz(v) && a[v.back()] <= a[i]) v.pop_back();
    l[i] = (sz(v) ? v.back() : 0) + 1;
    v.pb(i);
  }
  for (int i = 2; i <= n; i++) {
    calc(i);
  }
  cout << dp[k][n];
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -