oj.uz

답안 #168157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168157 2019-12-11T16:55:31 Z muhammad_hokimiyon K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 10 ms 2040 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

#define fi first
#define se second
#define ll long long

using namespace std;

const int N = 1e5 + 7;
const int mod = 1e9 + 7;

int n,k;
int a[N];
int d[111][N];

void solve()
{
    cin >> n >> k;
    for( int i = 1; i <= n; i++ ){
        cin >> a[i];
        d[1][i] = max( d[1][i - 1] , a[i] );
    }
    for( int i = 2; i <= k; i++ ){
        stack < pair < int , int > > st;
        d[i][i] = d[i - 1][i - 1] + a[i];
        st.push({d[i][i] - a[i] , a[i]});
        for( int j = i + 1; j <= n; j++ ){
            int cnt = d[i - 1][j - 1];
            while( !st.empty() && st.top().se <= a[j] ){
                cnt = min(cnt , st.top().fi);
                st.pop();
            }
            int x = 1e9;
            if( !st.empty() )x = st.top().fi + st.top().se;
            st.push({cnt , a[j]});
            d[i][j] = min(x , cnt + a[j]);
        }
    }
    cout << d[k][n];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    int t = 1;//cin >> t;
    while( t-- ){
        solve();
    }
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Incorrect 2 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 7 ms 1016 KB Output is correct
3 Incorrect 10 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -