 |
| ||||
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 | |||||||||
线性规划转化为对偶问题再用半平面求交，最后用logn的一维搜索……正在努力中……In Reply To:没有低于线性的算法吧，那怎么保证不超时？,10亿。。 Posted by:wrbuaa2005 at 2008-09-01 11:29:06 半平面交出来是个凸集，只需搜索交点，又1<=A,B,C<=10000，所以交点的值分布应当是凸函数，所以搜索过程可以用0.618法或者斐波那契法（不过还没想好这种离散点的情况下0.618法该怎么写）。 想想就头大，程序正在努力中，说实话实在不敢提交…… Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
