oj.uz

답안 #49824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49824 2018-06-03T11:19:17 Z mra2322001 K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 40 ms 36192 KB 
#include <bits/stdc++.h>
#define f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)

using namespace std;
typedef long long ll;
const int N = 100002;

int n, a[N], k;
ll f[N][102];

main(){
    ios_base::sync_with_stdio(0);

    cin >> n >> k;
    stack <int> s;
    f1(i, n){
        cin >> a[i];
        while(s.size() && a[s.top()] <= a[i]) s.pop();
        f1(j, k){
            if(i >= j){
                if(s.size()==0) f[i][j] = f[j - 1][j - 1] + a[i];
                else{
                    if(s.top() >= j - 1) f[i][j] = f[s.top()][j - 1] + a[i];
                    else f[i][j] = f[j - 1][j - 1] + a[i];
                }
            }
        }
        s.push(i);
    }
    ll res = f[n][k];
    ll ma = a[n];
    for(int j = n - 1; j >= k - 1; j--){
        res = min(res, f[j][k - 1] + ma);
        ma = max(ma, ll(a[j]));
    }
    cout << res;
}

Compilation message

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

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8632 KB Output is correct
2 Correct 31 ms 36180 KB Output is correct
3 Correct 40 ms 36192 KB Output is correct
4 Incorrect 37 ms 36192 KB Output isn't correct
5 Halted 0 ms 0 KB -