# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125497 | choikiwon | Railway Trip (JOI17_railway_trip) | C++17 | 287 ms | 19284 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;
typedef pair<int, int> pii;
const int MN = 100010;
int N, K, Q;
int L[MN];
int le[20][MN], ri[20][MN];
int main() {
scanf("%d %d %d", &N, &K, &Q);
for(int i = 0; i < N; i++) {
scanf("%d", &L[i]);
L[i]--;
}
stack<pii> stk;
for(int i = 0; i < N; i++) {
while(!stk.empty() && stk.top().first < L[i]) stk.pop();
if(!stk.empty()) le[0][i] = stk.top().second;
stk.push(pii(L[i], i));
}
while(!stk.empty()) stk.pop();
for(int i = N - 1; i >= 0; i--) {
while(!stk.empty() && stk.top().first < L[i]) stk.pop();
if(!stk.empty()) ri[0][i] = stk.top().second;
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... |