oj.uz

답안 #95249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
95249 2019-01-29T05:01:36 Z win11905 K개의 묶음 (IZhO14_blocks) C++11
0 / 100
 64 ms 42232 KB 
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author win11905
 */

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define iii tuple<int, int, int>
#define long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const long MOD = 1e9+7, LINF = 1e18 + 1e16;
const int INF = 1e9+1;
const double EPS = 1e-10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

const int N = 1e5+5;
const int K = 1e2+5;

class blocks {
private:
    int n, k;
    int dp[K][N];
    int A[N];
public:
    void solve(istream& cin, ostream& cout) {
        cin >> n >> k;
        for(int i = 1; i <= n; ++i) cin >> A[i];
        for(int i = 1; i <= n; ++i) dp[1][i] = max(dp[1][i-1], A[i]);
        for(int i = 2; i <= k; ++i) {
            stack<iii> stk;
            for(int j = i; j <= n; ++j) {
                int mnpos = j;
                while(!stk.empty() && get<0>(stk.top()) <= A[j]) mnpos = get<1>(stk.top()), stk.pop();
                stk.emplace(A[j], mnpos, min(dp[i-1][mnpos-1] + A[j], stk.empty() ? INF : get<2>(stk.top())));
                dp[i][j] = get<2>(stk.top());
            }
        }
        cout << dp[k][n] << endl;
    }
};

class Solver {
public:
    void solve(std::istream& in, std::ostream& out) {
        blocks *obj = new blocks();
        obj->solve(in, out);
    }
};

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    Solver solver;
    std::istream& in(std::cin);
    std::ostream& out(std::cout);
    solver.solve(in, out);
    return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 41848 KB Output is correct
2 Correct 34 ms 41848 KB Output is correct
3 Correct 35 ms 41848 KB Output is correct
4 Correct 35 ms 41820 KB Output is correct
5 Correct 35 ms 41848 KB Output is correct
6 Correct 34 ms 41792 KB Output is correct
7 Correct 34 ms 41848 KB Output is correct
8 Correct 34 ms 41848 KB Output is correct
9 Incorrect 34 ms 41828 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 41848 KB Output is correct
2 Correct 35 ms 41852 KB Output is correct
3 Correct 34 ms 41848 KB Output is correct
4 Correct 30 ms 41796 KB Output is correct
5 Correct 30 ms 41848 KB Output is correct
6 Correct 31 ms 41772 KB Output is correct
7 Correct 33 ms 41976 KB Output is correct
8 Correct 36 ms 41848 KB Output is correct
9 Incorrect 29 ms 41856 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 41848 KB Output is correct
2 Correct 39 ms 42104 KB Output is correct
3 Correct 40 ms 42232 KB Output is correct
4 Incorrect 64 ms 42204 KB Output isn't correct
5 Halted 0 ms 0 KB -