# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32219 | chonka | K blocks (IZhO14_blocks) | C++98 | 693 ms | 87832 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<stdio.h>
#include<stack>
#include<cstring>
using namespace std ;
#define inf 1000000007
#define MAXN 100007
#define MAXK 107
int n , k ;
int a[ MAXN ] ;
long long dp[ MAXN ][ MAXK ] ;
long long vals[ MAXN ] ;
long long pref[ MAXN ] ;
void input ( ) {
scanf ( "%d%d" , &n , &k ) ;
int i ;
for ( i = 1 ; i <= n ; i ++ ) {
scanf ( "%d" , &a[ i ] ) ;
}
}
void solve ( ) {
stack < pair < int , int > > s ;
int sz ;
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... |