Submission #671907

#	Time	Username	Problem	Language	Result	Execution time	Memory
671907		moday_morning	K blocks (IZhO14_blocks)	C++17	0 / 100	1 ms	340 KiB

blocks

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXX = 1e18 + 3;

int n, k, dp[200][200];
void solve () {
    cin >> n >> k;
    vector <int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        fill(dp[i], dp[i] + 200, MAXX);
    }
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            int mx = 0;
            for (int j = i; j >= 1 && j >= j; j--) {
                mx = max(mx, a[j]);
                dp[i][j] = min(dp[i][j], dp[j - 1][j - 1] + mx);
            }
        }
    }
    cout << dp[n][k] << "\n";
}

signed main() {
//    usaco("triangles");
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Compilation message (stderr)

blocks.cpp: In function 'void solve()':
blocks.cpp:18:41: warning: self-comparison always evaluates to true [-Wtautological-compare]
   18 |             for (int j = i; j >= 1 && j >= j; j--) {
      |                                       ~ ^~ ~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47