 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:吐血啊 WA十几次 谁能帮忙瞧一下哇In Reply To:吐血啊 WA十几次 谁能帮忙瞧一下哇 Posted by:Fynable at 2008-09-09 19:41:00 for(i=2;i<n;i++) {
int d=dirc(P[stack[top-1]],P[stack[top]],P[i]);
if(d<0) stack[++top]=i;
else stack[top]=i;
}
应该是这里
graham有问题。。。
刚看到这么短的程序本还想膜拜下的- -|||
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
