oj.uz

답안 #639522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639522 2022-09-10T12:12:39 Z nguyentu K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 1 ms 324 KB 
// https://oj.uz/problem/view/IZhO14_blocks
#include <bits/stdc++.h>

using namespace std;

#define ii pair<int , int>  
#define iv pair<ii , ii>
#define iii pair<int , ii>
#define fi first
#define se second
#define int long long

const int inf = 1e18 + 7;
const int N = 3e5 + 7;
const int MOD = 1e9 + 7;

int a[N] , b[N]; 
int f[N][107];

main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    int n , k; cin >> n >> k;
    for (int i = 1 ; i <= n ; i++) {
        cin >> a[i];
    }
    for (int i = 1 ; i <= n ;i ++) {
        for (int j = 0 ; j <= k ; j++) {
            f[i][j] = inf;
        }
    }
    deque<ii> dq;
    a[0] = inf;
    dq.push_back(ii(0 , 0));
    f[0][0] = 0;
    for (int j = 1 ; j <= k ; j++) {
        deque<ii> dq;
        dq.push_back(ii(0 , inf));
        for (int i = j ; i <= n ;i ++) {
            int cxcuti = f[i - 1][j - 1];
            while (!dq.empty() && a[dq.back().fi] <= a[i]) {
                cxcuti = min(cxcuti , dq.back().se);
                dq.pop_back();
            } 
            if (dq.back().fi > 0) f[i][j] = f[dq.back().fi][j - 1];
            f[i][j] = min(f[i][j] ,cxcuti + a[i]);
            dq.push_back(ii(i , min(f[i][j] , cxcuti)));
        }
    }
    //for (int j = 1 ; j <= k ; j++) {
    // for (int i = 1 ; i <= n ; i++) {
    //         cout << f[i][j] << " ";
    //     }
    //     cout << '\n';
    // }
    cout << f[n][k];
    return 0;
}

Compilation message

blocks.cpp:20:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   20 | main() {
      | ^~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -