# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171168 | CrabCNH | K blocks (IZhO14_blocks) | C++20 | 0 ms | 400 KiB |
#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
using namespace std;
template <class T> void mini (T &t, T f) {if (t > f) t = f;}
template <class T> void maxi (T &t, T f) {if (t < f) t = f;}
const int maxN = 1e5 + 5;
const int maxK = 1e2 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
int n, K;
int a[maxN];
int dp[maxN][maxK]; // minium splited with k values in current i
// dp i k = max (dp j k - 1 + max (ai -> aj))
struct ST {
int st[maxN * 4];
void upd (int id, int l, int r, int pos, int val) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |