# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154109 | beso123 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 3020 ms | 84076 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 N = 1e6+9;
int w[N], l[N], n, m,ans[N], L[N], R[N], F[N];
set<int > s;
void ad(int l, int r){
auto it = s.lower_bound(l);
if(it != s.end() && F[*it] <= r) return;
while(it != s.begin() && F[*(--it)] >= r){
s.erase(it);
it = s.lower_bound(l);
}
F[l] =r;
s.insert(l);
}
main(){
int n;
cin >> n >> m;
for(int i = 1; i <= n; i++){
scanf("%d",&w[i]);
}
stack<int> S;
for(int i = 1; i <= n; i++){
while(S.size() && w[S.top()] <= w[i]) S.pop();
if(!S.size()) l[i] = 0;
else l[i] = S.top();
S.push(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |