# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570295 | FirasMesbeh | Rainforest Jumps (APIO21_jumps) | C++17 | 0 ms | 0 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;
int n, a[N];
void init(int N, vector<int> H) {
for (int i = 1; i <= N; ++ i) {
a[i] = H[i - 1];
}
}
int minimum_jumps(int A, int B, int C, int D) {
return (C - B);
}