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 tq at 2005-08-07 20:46:58 on Problem 2456
In Reply To:先对给定的位置从小到大排序,然后用折半(二分)来 确定largest minimal distance!! 超时啊!! Posted by:ook at 2005-07-26 19:24:10 
#include <algorithm>
using namespace std;
long  a[100001];

读完之后,用:

sort(a+1,a+n+1)就可以排好序了.比你自己写快多了哦~
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