This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
#ifndef call_from_test #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE template<typename T, typename F> struct RangeSlide{ vector<size_t> ls,rs; vector<T> vs; F cmp; RangeSlide(vector<T> vs,F cmp):vs(vs),cmp(cmp){} void add_range(size_t l,size_t r){ ls.emplace_back(l); rs.emplace_back(r); } vector<size_t> build(){ deque<size_t> deq; vector<size_t> res; for(size_t i=0,l=0,r=0;i<ls.size();i++){ if(r<=ls[i]){ deq.clear(); l=r=ls[i]; } while(r<rs[i]){ while(!deq.empty() and !cmp(vs[deq.back()],vs[r])) deq.pop_back(); deq.emplace_back(r++); } while(l<ls[i]){ if(deq.front()==l++) deq.pop_front(); } res.emplace_back(deq.front()); } return res; } }; //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif
#line 1 "datastructure/rangeslide.cpp" #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE template<typename T, typename F> struct RangeSlide{ vector<size_t> ls,rs; vector<T> vs; F cmp; RangeSlide(vector<T> vs,F cmp):vs(vs),cmp(cmp){} void add_range(size_t l,size_t r){ ls.emplace_back(l); rs.emplace_back(r); } vector<size_t> build(){ deque<size_t> deq; vector<size_t> res; for(size_t i=0,l=0,r=0;i<ls.size();i++){ if(r<=ls[i]){ deq.clear(); l=r=ls[i]; } while(r<rs[i]){ while(!deq.empty() and !cmp(vs[deq.back()],vs[r])) deq.pop_back(); deq.emplace_back(r++); } while(l<ls[i]){ if(deq.front()==l++) deq.pop_front(); } res.emplace_back(deq.front()); } return res; } }; //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif