再思考一下好的方法，水过，数据太弱！ 本来不想传的！

 

#include 
    
     using namespace std;#define MAX 702 /*284K	422MS*/typedef struct _point{     int x;     int y;}point;point p[MAX];bool judge(point a,point b,point c){     return (a.y-b.y)*(c.x-b.x)-(c.y-b.y)*(a.x-b.x);}int main(){   int n;   while(cin>>n)   {        if(n==0)   break;        for(int i=0;i
     
      >p[i].x>>p[i].y;        int max=0;        //暴力搜索        for(int k=0;k