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

Re:这是我POJ3436的代码,不是拆点做的。怎样也发现不了问题,测试了N个例子了,牛人帮我看看

Posted by 455462586 at 2011-11-18 23:20:57
In Reply To:这是我POJ3436的代码,不是拆点做的。怎样也发现不了问题,测试了N个例子了,牛人帮我看看 Posted by:Lyy289065406 at 2011-02-28 22:04:31
和我的思路类似,不同的是我的是:对于(i,j),E(I,J)=q[j].而你的E[I,J]=MIN(Q[I],Q[J]);

我的也wa了,之前用deque,一直RE,现在换成数组队列,一直wa.这个思路哪儿错误吗?求解答!

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