# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745421 | blue | Railway Trip (JOI17_railway_trip) | C++17 | 259 ms | 17092 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;
using vi = vector<int>;
using vvi = vector<vi>;
const int lg = 17;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, K, Q;
cin >> N >> K >> Q;
vi L(1+N);
for(int i = 1; i <= N; i++)
cin >> L[i];
int lh[1+lg][1+N], rh[1+lg][1+N];
lh[0][1] = 1;
for(int i = 2; i <= N; i++)
{
lh[0][i] = i-1;
while(L[lh[0][i]] < L[i])
lh[0][i] = lh[0][ lh[0][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... |