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 Isun at 2008-06-10 05:06:34 on Problem 2966 and last updated at 2008-06-10 05:07:14
In Reply To:用弗洛伊德才过，真是没法了…… Posted by:Isun at 2008-06-10 04:31:16 
// 从a点沿逆时针走到b点的最小距离

double med(int a, int b)
{
	if (a > b)
		b += n;
	double ret = 0;
	top = 0;
	stk[top++] = P[a%n];
	for (int i = a+1; i <= b; i++)
	{
		while (top > 1 && cpr(stk[top-2], stk[top-1], P[i%n]) < -eps)
			top--;
		stk[top++] = P[i%n];
	}
	for (int i = 0; i < top-1; i++)
		ret += dis(stk[i], stk[i+1]);
	return ret;
}
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