# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93336 | 3zp | K blocks (IZhO14_blocks) | C++14 | 20 ms | 11512 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;
const int mn = 100009, mk = 109;
int f[mn][mk], n, k;
int l[mn], r[mn], a[mn];
vector<int> v[mn];
int dp[mn][mk];
void upd(int i, int j, int d){
i = n + 1 - i;
while(i <= n + 1){
f[i][j] = min(f[i][j], d);
i += (i & -i);
}
}
int cnt(int i, int j){
i = n + 1 - i;
int ans = 1e9;
while(i){
ans = min(ans, f[i][j]);
i -= (i & -i);
}
return ans;
}
main(){
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
stack<int> S;
for(int i = 1; i <= n; i++){
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... |