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

提示几点

Posted by zqu_Empire at 2009-10-12 23:29:06 on Problem 2262
1、时间复杂度要求还是挺高的,如果写成o(n^2),肯定超时的;
2、先打表可以节省一些时间;
3、在搜索过程中i,n-i已成功,就是答案啦··

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