# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377228 | CaroLinda | K blocks (IZhO14_blocks) | C++14 | 195 ms | 4208 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 all(x) x.begin(),x.end()
#define sz(x) (int)(x.size() )
#define lp(i,a,b) for(int i = a; i< b ; i++ )
#define pii pair<int,int>
const int MAXN = 1e5+10 ;
const ll inf = 1e15+10LL ;
using namespace std ;
int N , K ;
int lef[MAXN] , opt[MAXN] ;
ll arr[MAXN];
ll dp[2][MAXN] ;
int main()
{
scanf("%d %d", &N , &K ) ;
for(int i = 1 , mx = 0 ; i <= N ; i++ )
{
scanf("%lld", &arr[i] ) ;
if( arr[i] > mx ) mx = arr[i] ;
dp[0][i] = mx ;
}
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... |