This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_3_D #include <bits/stdc++.h> using namespace std; #define call_from_test #include "../../datastructure/rangeslide.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int n,l; cin>>n>>l; vector<int> as(n); for(int i=0;i<n;i++) cin>>as[i]; auto cmp=[](int a,int b){return a<b;}; RangeSlide<int, decltype(cmp)> rs(as,cmp); for(int i=0;i+l<=n;i++) rs.add_range(i,i+l); auto res=rs.build(); for(int i=0;i+l<=n;i++){ if(i) cout<<" "; cout<<as[res[i]]; } cout<<endl; return 0; }
#line 1 "test/aoj/DSL_3_D.test.cpp" // verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_3_D #include <bits/stdc++.h> using namespace std; #define call_from_test #line 1 "datastructure/rangeslide.cpp" #line 3 "datastructure/rangeslide.cpp" 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 8 "test/aoj/DSL_3_D.test.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int n,l; cin>>n>>l; vector<int> as(n); for(int i=0;i<n;i++) cin>>as[i]; auto cmp=[](int a,int b){return a<b;}; RangeSlide<int, decltype(cmp)> rs(as,cmp); for(int i=0;i+l<=n;i++) rs.add_range(i,i+l); auto res=rs.build(); for(int i=0;i+l<=n;i++){ if(i) cout<<" "; cout<<as[res[i]]; } cout<<endl; return 0; }