# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92769 | SamAnd | K blocks (IZhO14_blocks) | C++17 | 247 ms | 41212 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 <iostream>
#include <stack>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100005, K = 102;
int n, k;
int a[N];
int dp[K][N];
int main()
{
//freopen("input2.txt", "r", stdin);
//freopen("blocks.in", "r", stdin);
//freopen("blocks.out", "w", stdout);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int maxu = 0;
for (int j = 1; j <= n; ++j)
{
maxu = max(maxu, a[j]);
dp[1][j] = maxu;
}
for (int i = 2; i <= k; ++i)
{
stack<int> s, ss, minudp;
# | 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... |