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 |
10几MS的大牛们是怎么做的阿?请教我是O(2*n)的 第一遍dp是边读入边处理 反向的时候边dp边记录最大值 感觉已经很快了阿 不知道大牛们用的什么方法阿 莫非只读一遍就能处理出结果? Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator