# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165268 | Bojack | Triple Jump (JOI19_jumps) | C++14 | 84 ms | 7144 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 long long ll;
void solve() {
int n; scanf("%d", &n);
vector <int> a(n);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int q; scanf("%d", &q);
while(q--) {
int l, r; scanf("%d", &l, &r);
}
stack <int> s;
vector <pair <int, int>> can;
for(int i = n - 1; i >= 0; i--) {
while(!s.empty() and a[s.top()] < a[i]) {
can.push_back({s.top(), i});
s.pop();
}
if(!s.empty()) {
can.push_back({i, s.top()});
}
s.push(i);
}
vector <int> mx(n);
mx[n - 1] = a[n - 1];
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... |