FZUoj2035（几何）

题意：顺时针或逆时针给一个n凸多边各点的坐标，问此多边形是否是轴对称多边形。

解法：当ｎ为偶数时候，对称轴是一条边的垂直平分线或者是两个点的连线。都可以Ｏ(n)枚举，此时再判断其余点是否关于此轴对称；

　　　当ｎ为奇数时候，对称轴只能是一条边的垂直平分线。同样枚举。

　　　总复杂度是Ｏ(n^2);

代码：

/****************************************************
* author:xiefubao
*******************************************************/
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <string.h>

using namespace std;

#define eps (1e-8)
typedef long long LL;

int n;
struct point
{
    double x,y;
} points[510];
double getdis(point a,point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
bool para(int i,int j,int h,int k)
{
    //if()
    if(abs(points[j].x-points[i].x)<=eps&&abs(points[h].x-points[k].x)<=eps)
        return true;
    if(abs(points[j].x-points[i].x)<=eps||abs(points[h].x-points[k].x)<=eps)
        return false;
    double ans1=(points[j].y-points[i].y)/(points[j].x-points[i].x);
    double ans2=(points[h].y-points[k].y)/(points[h].x-points[k].x);
    return abs(ans1-ans2)<=eps;
}
bool OK(int i,int j,int h,int k)
{
    i=(i+3*n)%n;
    j=(j+3*n)%n;
    h=(h+3*n)%n;
    k=(k+3*n)%n;
    if(!para(i,j,h,k))
        return false;
    point p;
    p.x=(points[i].x+points[j].x)/2.0;
    p.y=(points[i].y+points[j].y)/2.0;
    if(abs(getdis(points[h],p)-getdis(points[k],p))<=eps)
        return true;
    return false;
}
int main()
{
  int t;
  int ncase=0;
  cin>>t;
  while(t--)
  {
      cin>>n;ncase++;
      for(int i=n-1;i>=0;i--){
          cin>>points[i].x>>points[i].y;
      }
      if((n&1)==0)
      {
          bool ans=0;
      for(int i=0;i<n;i++)
      {
          bool flag=1;
          for(int j=1;j<n/2;j++)
          {
              if(!OK(i,i+1,i+1+j,i-j))
              {
                  flag=0;break;
              }
          }
          if(flag){ans=1;break;}
      }
      if(!ans)
      for(int i=0;i<n/2;i++)
      {
          bool flag=1;
          for(int j=1;j<n/2;j++)
          {
                  int a=(i+j)%n;
                  int b=(i-j+n)%n;
              if(abs(getdis(points[i],points[a])-getdis(points[i],points[b]))>eps||
                 abs(getdis(points[i+n/2],points[a])-getdis(points[i+n/2],points[b]))>eps)
                {
                    flag=0;break;
              }
          }
          if(flag){ans=1;break;}
      }
      if(ans) printf("Case %d: YES\n",ncase);
      else printf("Case %d: NO\n",ncase);
      }
      else
      {
          bool ans=0;
          for(int i=0;i<n;i++)
          {
              if(!(abs(getdis(points[i],points[(i+1+n/2)%n])-getdis(points[(i+1)%n],points[(i+1+n/2)%n]))<=eps))
                continue;
              bool flag=1;
              for(int j=1;j<n/2;j++)
              {
                  if(!OK(i,i+1,i+1+j,i-j)){
                      flag=0;break;
                  }
              }
              if(flag)
              {
                  ans=1;
                  break;
              }
          }
          if(ans) printf("Case %d: YES\n",ncase);
          else printf("Case %d: NO\n",ncase);
      }
  }
   return 0;
}