当前位置:首页 > 标签 > 可持久化线段树
  • POJ2104K-thNumber

    分类:线段树   日期:01-11

    题目大意:n个数,m个询问,每次询问区间[l, r]直接第k小是多少? Description You are working for Macrohard company in data structures department. ...

    围观:2001+ | 抢沙发