oj.uz

답안 #337235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337235 2020-12-19T02:04:44 Z boykut K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 1 ms 364 KB 
#include <iostream>
#include <stack>
#include <vector>
#include <map>

using namespace std;

const int inf = 2e9;

int dp[100001][101];
int a[100001];

int32_t main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
   int N, K;
   cin >> N >> K;
   
   for (int i = 1; i <= N; i++) {
      cin >> a[i];
   }
   
   for (int i = 0; i <= N; i++) {
      for (int j = 0; j <= K; j++) {
         dp[i][j] = inf;
      }
   }
   
   dp[0][0] = 0;
   dp[1][1] = a[1];
   for (int i = 2; i <= N; i++) {
      dp[i][1] = max(dp[i - 1][1], a[i]);
   }
   
   auto getmax = [&](int l, int r) -> int {
      int mx = a[l];
      for (int i = l; i <= r; i++) {
         mx = max(mx, a[i]);
      }
      return mx;
   };
   
   for (int k = 2; k <= K; k++) {
      stack < pair < int, int > > st;
      for (int i = 1; i <= N; i++) {
         int mn = dp[i - 1][k - 1];
         while (!st.empty() && a[st.top().first] <= a[i]) {
            mn = min(mn, st.top().second);
            st.pop();
         }
         if (!st.empty())
            dp[i][k] = min(dp[i][k], dp[st.top().first][k - 1]);
         dp[i][k] = min(dp[i][k], mn + a[i]);
         st.push({i, mn});
      }
   }
   
   cout << dp[N][K] << '\n';
   
   return 0;
}

Compilation message

blocks.cpp: In function 'int32_t main()':
blocks.cpp:35:9: warning: variable 'getmax' set but not used [-Wunused-but-set-variable]
   35 |    auto getmax = [&](int l, int r) -> int {
      |         ^~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 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 -