oj.uz

답안 #172657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172657 2020-01-02T09:42:57 Z Swan K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 677 ms 43228 KB 
#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;

int dp[105][100005];
int a[100005];
int n,k;

int main(){
    scanf("%d %d",&n,&k);
    int maxv = 0;
    memset(dp,0x3f,sizeof(dp));
    for (int i=1; i<=n; i++) {
        scanf("%d",&a[i]);
        maxv = max(maxv,a[i]);
        dp[1][i] = maxv;
    }
    for (int i=2; i<=k; i++) {
        stack<int> s1,s2;
        for (int j=1; j<=n; j++) {
            //cout << j << ' ' << s1.size() << endl;
            if(s1.size())cout << s1.top() << endl;
            int my_dp = dp[i-1][j-1];
            while (!s1.empty() && s1.top() < a[j]) {
                my_dp = min(my_dp,s2.top());
                s1.pop();
                s2.pop();
            }
            if(s1.empty() || my_dp + a[j] < s1.top() + s2.top()){
                s1.push(a[j]);
                s2.push(my_dp);
            }
            if(j >= i) dp[i][j] = s1.top() + s2.top();
        }
    }
    printf("%d",dp[k][n]);
}
/*
6 2
1 2 3 4 5 6
*/

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
blocks.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 41436 KB Output is correct
2 Correct 41 ms 41464 KB Output is correct
3 Correct 37 ms 41464 KB Output is correct
4 Incorrect 36 ms 41336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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