fork download
  1. #include<set>
  2. #include<vector>
  3. #include<utility>
  4. using namespace std;
  5.  
  6. void slidingwindow_bst(vector<int> array, vector<int> &minv, vector<int> &maxv){
  7. // (value, pos) 쌍으로 저장
  8. // C++ pair의 기본 less 연산은 앞에 오는 원소를 먼저 비교함 :)
  9. set<pair<int, int> > bst;
  10. int i;
  11. for(i = 0; i < K; ++i)
  12. bst.insert( make_pair(array[i], i) );
  13.  
  14. minv.push_back( bst.begin() -> first );
  15. maxv.push_back( bst.rbegin() -> first );
  16.  
  17. for(i = K; i < array.size(); ++i){
  18. bst.erase( make_pair( arrray[i - K], i-K );
  19. bst.insert(make_pair( array[i] , i );
  20. minv.push_back( bst.begin() -> first );
  21. maxv.push_back( bst.rbegin() -> first );
  22. }
  23. }
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
Standard input is empty
compilation info
prog.cpp: In function ‘void slidingwindow_bst(std::vector<int>, std::vector<int>&, std::vector<int>&)’:
prog.cpp:11:17: error: ‘K’ was not declared in this scope
prog.cpp:17:10: error: ‘K’ was not declared in this scope
prog.cpp:17:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
prog.cpp:18:25: error: ‘arrray’ was not declared in this scope
prog.cpp:19:45: error: expected ‘)’ before ‘;’ token
stdout
Standard output is empty