Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:见内

Posted by star6 at 2007-09-29 19:07:23
In Reply To:见内 Posted by:lunatic at 2007-09-29 14:59:52
我就是这样~~tle地~~

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

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


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