Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

原来是归并排序！好土，想复杂了，线段树优化了半天才ac

Posted by mmd at 2007-09-29 19:25:26
In Reply To:见内 Posted by:lunatic at 2007-09-29 14:59:52

> 等于判断[l..r]这一段中段 <= t的个数
> 分治的话就是序列切两半，先递归求解，然后求跨过中间的，跨过中间的就是把两边部分和排序扫描一遍
> 线段树的话就是统计部分和．．

Followed by:

我是说我好土... (0) mmd 2007-09-29 19:26:40
- 和poj2104一个模样…… (0) frkstyc 2007-09-29 19:28:50
  - 还是不会阿！ (0) star6 2007-09-29 19:38:32
  - 不一样吧。。。 (0) ACM06060 2007-09-29 19:40:33
  - 我还是不明白负数怎么办………… (0) hust07p43 2007-09-29 21:47:16
    - 有点小明白了…… (0) hust07p43 2007-09-29 21:48:02
AC就是猛。。。 (0) ACM06060 2007-09-29 19:28:39

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator