# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13532 | woqja125 | K blocks (IZhO14_blocks) | C++98 | 1 ms | 43928 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<stdio.h>
int max(int a, int b){return a>b?a:b;}
int min(int a, int b){return a<b?a:b;}
int dp[101][100001];
int IT[300001];
int IT2[300001];
int b = 1;
int a[100001];
int bb[100001];
int getmin(int f, int r);
int getmin2(int f, int r);
void set2(int x, int v);
int main()
{
int n, k;
int i, j;
scanf("%d%d", &n, &k);
for(b=1; b<=n; b*=2);
for(i=1; i<=n; i++) scanf("%d", a+i);
int stk[100001], top=-1;
for(i=1; i<=n; i++)
{
while(top != -1 && a[stk[top]] < a[i])top--;
if(top == -1) bb[i] = -1;
else bb[i] = stk[top];
stk[++top] = i;
}
for(i=1; i<=n; i++) dp[1][i] = max(a[i], dp[1][i-1]);
for(i=2; i<=k; 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... |