# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171551 | AlgorithmWarrior | K blocks (IZhO14_blocks) | C++20 | 138 ms | 3228 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=1e5+5;
long long dp[MAX];
long long old_dp[MAX];
int n,k;
int v[MAX];
void read(){
cin>>n>>k;
int i;
for(i=1;i<=n;++i)
cin>>v[i];
}
void minself(long long& x,long long val){
if(x>val)
x=val;
}
struct structy{
int val;
long long old,dp;
};
void upgrade(){
int i;
for(i=0;i<=n;++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... |