 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
呵呵，我那篇稿子你还有搜藏啊？？这道题是O(n)的DP做最好，线段树就是不快...In Reply To:前两天看你写的那篇全英文的Segment tree&Tree Array.终于就学会线段树了..然后把这个题写了，将近10s，刚才我又交了一个用堆的。。6XXXms。。看来我的线段树写得太烂了。。 Posted by:hysramp at 2008-02-10 00:55:05 rt Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
