# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155534 | Learner99 | K blocks (IZhO14_blocks) | C++14 | 695 ms | 160556 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>
using namespace std;
#define int long long
#define N 100006
int inf =10000000000006;
int dp[N][101];
int ind[N][101];
int pre[N];
int32_t main()
{
int n, k;
cin>>n>>k;
vector < int > a(n+1);
for(int i=1;i<=n;i++)
cin>>a[i];
a[0] = inf;
int cur = 1;
for(int i=1;i<=n;i++)
{
if( a[cur] < a[i])
# | 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... |