 |
| ||||
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 | |||||||||
今天ustc的oj确实不错,速度很快,赞..有个问题请教,关于1006请教下大致做法In Reply To:要的就是这种OJ的速度！速度确实快啊！秒出提交结果。。 Posted by:11223344 at 2008-09-29 18:40:54 那题我开始离散化,tle,以那题数据规模否定了线段树的嫌疑 之后思考许久,终于得出了稍为可行的做法,矩型切割,但wa到无语. 之后队友出了多组数据,发现了问题.但时间已不等人. 请教那题过了人的做法,是用矩型切割吗,请好心的大牛帮下忙.告诉下矩行切割可行否,还是我的想法有根本错误..非常感谢.. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
