제출 #38200

#제출 시각아이디문제언어결과실행 시간메모리
38200TalantK개의 묶음 (IZhO14_blocks)C++14
100 / 100
229 ms81972 KiB
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const ll inf = (ll)1e18 + 7;
const int N = (int)1e5 + 7;

int n,k;
int a[N];
ll dp[101][N];

int main () {
        cin >> n >> k;

        for (int i = 1; i <= n; i ++)
                scanf ("%d", &a[i]);

        memset(dp,0x3f3f3f3f,sizeof(dp));

        dp[0][0] = 0;

        for (int i = 1; i <= k; i ++) {
                stack <pair<ll,ll> > st;
                st.push({inf,inf});

                for (int j = i; j <= n; j ++) {
                        ll cur = dp[i - 1][j - 1];
                        while (!st.empty() && st.top().fr <= a[j]) {
                                cur = min(cur,st.top().sc);
                                st.pop();
                        }
                        dp[i][j] = min(st.top().fr + st.top().sc,cur + a[j]);
                        if (st.top().fr + st.top().sc > cur + a[j])
                                st.push({a[j],cur});
                }
        }
        cout << dp[k][n] << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'int main()':
blocks.cpp:24:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%d", &a[i]);
                                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...