oj.uz

답안 #1077129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077129 2024-08-27T01:23:29 Z duyhoanho K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 44 ms 80312 KB 
#include <bits/stdc++.h>
#define task ""
#define int long long
#define forinc(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
const int N=1e5+10;
int n,a[N],dp[N][102],k;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  if (fopen ("blocks.in", "r")) {
    freopen ("blocks.inp", "r", stdin);
    freopen ("blocks.out", "w", stdout);
  }
  cin>>n>>k;
  memset(dp,99,sizeof dp);
  int mx=0;
  forinc(i,1,n)
  {
    cin>>a[i];
    mx=max(mx,a[i]);
    dp[i][1] = mx;
    dp[i][0] = 0;
  }
  dp[0][0]=0;
  for(int j=2;j<=k;j++)
  {
    stack<int> st;
    for(int i=1;i<=n;i++)
    {
      while(st.size() && a[st.top()] <= a[i] )
      {
        dp[i][j] = min(dp[i][j] , dp[st.top()][j-1] + a[i]);
        dp[i][j]=min(dp[i][j],dp[st.top()][j] - a[st.top()] + a[i]);
        st.pop();
      }
      st.push(i);
    }
  }
  cout<<dp[n][k];
}

Compilation message

blocks.cpp: In function 'int32_t main()':
blocks.cpp:13:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen ("blocks.inp", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:14:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen ("blocks.out", "w", stdout);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 80284 KB Output is correct
2 Correct 36 ms 80200 KB Output is correct
3 Correct 40 ms 80312 KB Output is correct
4 Correct 35 ms 80208 KB Output is correct
5 Incorrect 44 ms 80212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 80216 KB Output is correct
2 Correct 38 ms 80212 KB Output is correct
3 Correct 38 ms 80212 KB Output is correct
4 Correct 35 ms 80144 KB Output is correct
5 Incorrect 36 ms 80220 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 80284 KB Output is correct
2 Correct 36 ms 80200 KB Output is correct
3 Correct 40 ms 80312 KB Output is correct
4 Correct 35 ms 80208 KB Output is correct
5 Incorrect 44 ms 80212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 80284 KB Output is correct
2 Correct 36 ms 80200 KB Output is correct
3 Correct 40 ms 80312 KB Output is correct
4 Correct 35 ms 80208 KB Output is correct
5 Incorrect 44 ms 80212 KB Output isn't correct
6 Halted 0 ms 0 KB -