C++博客-Dream On-最新评论http://www.cppblog.com/fireduck/CommentsRSS.aspx今天很残酷，明天更残酷，后天很美好，但绝对大部分是死在明天晚上，所以每个人不要放弃今天。zh-cnSun, 26 Dec 2010 12:54:51 GMTSun, 26 Dec 2010 12:54:51 GMTcnblogsre: 10年最后一场网络http://www.cppblog.com/fireduck/archive/2010/10/10/129353.html#129372FireDuckFireDuckSun, 10 Oct 2010 14:15:00 GMThttp://www.cppblog.com/fireduck/archive/2010/10/10/129353.html#129372你可以参阅一下博客的解体报告，应该能比我说的清楚http://hi.baidu.com/aekdycoin/blog/item/e87f5f9653423c6255fb969b.html

FireDuck 2010-10-10 22:15 发表评论
]]>re: 10年最后一场网络[未登录]http://www.cppblog.com/fireduck/archive/2010/10/10/129353.html#129364小强小强Sun, 10 Oct 2010 12:35:00 GMThttp://www.cppblog.com/fireduck/archive/2010/10/10/129353.html#129364
#include<iostream>
using namespace std;
struct point
{
int x,y;
}s[1001],os[1001];
int mycompare(const void *ele1,const void *ele2)
{
point *p1,*p2;
p1=(point*)ele1;
p2=(point*)ele2;
if(p1->x==p2->x)
return (p1->y-p2->y);
return (p1->x-p2->x);
}//x up then y up
int xmult(point p1,point p2,point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
bool pd(point s,point a,point b,point c)
{
if(xmult(a,s,b)*xmult(c,s,b)>=0)
return 0;
if(xmult(a,s,c)*xmult(b,s,c)>=0)
return 0;
if(xmult(b,s,a)*xmult(c,s,a)>=0)
return 0;
return 1;
}
int main()
{
int i,j,m,n,k,sum;
int a,b,c;
while(scanf("%d",&k)!=EOF)
{
for(j=1;j<=k;j++)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&s[i].x,&s[i].y);
os[i].x=s[i].x;os[i].y=s[i].y;
}
qsort(os,n,sizeof(point),mycompare);
//for(i=0;i<n;i++)
//cout<<os[i].x<<" "<<os[i].y<<endl;
scanf("%d",&m);
cout<<"Case "<<j<<":"<<endl;
while(m--)
{
cin>>a>>b>>c;
int maxx=s[a].x>s[b].x?s[a].x:s[b].x;
if(s[c].x>maxx) maxx=s[c].x;
int minx=s[a].x<s[b].x?s[a].x:s[b].x;
if(s[c].x<minx) minx=s[c].x;
int maxy=s[a].y>s[b].y?s[a].y:s[b].y;
if(s[c].y>maxy) maxy=s[c].y;
int miny=s[a].y<s[b].y?s[a].y:s[b].y;
sum=0;
for(i=0;i<n;i++)
{
if(os[i].x<minx) continue;
if(os[i].x>maxx) break;
if(os[i].y<miny||os[i].y>maxy) continue;
if(pd(s[i],s[a],s[b],s[c]))
sum++;
}
cout<<sum<<endl;
}
}
}
}



小强 2010-10-10 20:35 发表评论
]]>