# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331356 | loilon504 | K blocks (IZhO14_blocks) | C++14 | 157 ms | 41580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define fi(i,a,b) for(int i=a; i<=b; i++)
#define fid(i,a,b) for(int i=a; i>=b; i--)
#define VanLoi ""
#define gb(i, j) ((i >> j) & 1)
#define MOD 1000000007
#define N 1000005
using namespace std;
int n, k, a[N], f[105][N], top;
struct pii {
int F, S;
} q[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
fi(i, 1, k)
fi(j, 0, n) f[i][j] = 1e9;
f[1][0] = 0;
fi(i, 1, n) cin >> a[i], f[1][i] = max(f[1][i - 1], a[i]);
f[1][0] = 1e9;
fi(i, 2, k) {
top = 0;
q[0].S = 0;
# | 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... |