判断点是否在多边形里面：CodeForces - 659D Bicycle Race

有超级简单的思路就是：

因为是直角拐弯，所以内角要么是90度，要么是270度，设270的角的个数为x，则可得方程180*(n-2)=270*x+(n-x)*90; 
化简得：x=(n-4)/2;
但是学会了判断点是否在多边形里面的办法也超开心！ 
虽然很麻烦orz
http://codeforces.com/contest/659/problem/D

 
 

  
  

   
   D. Bicycle Race
  
  
  
  

   
   

    
    time limit per test
   
   
1 second
  
  
  
  

   
   

    
    memory limit per test
   
   
256 megabytes
  
  
  
  

   
   

    
    input
   
   
standard input
  
  
  
  

   
   

    
    output
   
   
standard output
  
  
 
 
 
 

  
  
Maria participates in a bicycle race.
  
  
The speedway takes place on the shores of Lake Lucerne, just repeating its contour. As you know, the lake shore consists only of straight sections, directed to the north, south, east or west.
  
  
Let's introduce a system of coordinates, directing the Ox axis from west to east, and the Oy axis from south to north. As a starting position of the race the southernmost point of the track is selected (and if there are several such points, the most western among them). The participants start the race, moving to the north. At all straight sections of the track, the participants travel in one of the four directions (north, south, east or west) and change the direction of movement only in bends between the straight sections. The participants, of course, never turn back, that is, they do not change the direction of movement from north to south or from east to west (or vice versa).
  
  
Maria is still young, so she does not feel confident at some turns. Namely, Maria feels insecure if at a failed or untimely turn, she gets into the water. In other words, Maria considers the turn dangerous if she immediately gets into the water if it is ignored.
  
  
Help Maria get ready for the competition — determine the number of dangerous turns on the track.
 
 
 
 

  
  

   
   Input
  
  
  
  
The first line of the input contains an integer n (4 ≤ n ≤ 1000) — the number of straight sections of the track.
  
  
The following (n + 1)-th line contains pairs of integers (xi, yi) ( - 10 000 ≤ xi, yi ≤ 10 000). The first of these points is the starting position. The i-th straight section of the track begins at the point (xi, yi) and ends at the point (xi + 1, yi + 1).
  
  
It is guaranteed that:
  
  
 the first straight section is directed to the north; 
 the southernmost (and if there are several, then the most western of among them) point of the track is the first point; 
 the last point coincides with the first one (i.e., the start position); 
 any pair of straight sections of the track has no shared points (except for the neighboring ones, they share exactly one point); 
 no pair of points (except for the first and last one) is the same; 
 no two adjacent straight sections are directed in the same direction or in opposite directions. 
 
 
 
 

  
  

   
   Output
  
  
  
  
Print a single integer — the number of dangerous turns on the track.
 
 
 
 

  
  Examples
 
 
 
 

  
  

   
   Input
  
  
  
  
6
0 0
0 1
1 1
1 2
2 2
2 0
0 0

 
 
 
 

  
  

   
   Output
  
  
  
  
1

 
 
 
 

  
  

   
   Input
  
  
  
  
16
1 1
1 5
3 5
3 7
2 7
2 9
6 9
6 7
5 7
5 3
4 3
4 4
3 4
3 2
5 2
5 1
1 1

 
 
 
 

  
  Output
 
 
6
#include<map>
#include<iostream>
#include<cstdio>
#include<cmath>
    using namespace std;
int n;
int x[1001];
int y[1001];
map<pair<int,int>,bool>my_map;
bool check(int xx,int yy){
    int i,j=n-1;
    bool flag=false;
    for(i=0;i<n;i++){
        if((y[i]<yy&&y[j]>=yy||y[j]<yy&&y[i]>=yy)&&(x[i]<=xx||x[j]<=xx)){
            flag^=(x[i]+(yy-y[i])/(y[j]-y[i])*(x[j]-x[i])<xx);
        }
        j=i;
    }
    flag&=(my_map[pair<int,int>(xx, yy)] == false);
    return flag;
}
bool fun(int x1,int y1,int x2,int y2){
    int xx,yy;
    if(x1==x2){
        xx=x1;
        yy=y2+(y2-y1)/abs(y2-y1);
    }
    if(y1==y2){
        yy=y1;
        xx=x2+(x2-x1)/abs(x2-x1);
    }
    return check(xx,yy);
}
int main(){
    int count=0;
    cin>>n;
    n++;
    my_map.clear();
    for(int i=0;i<n;i++){
        cin>>x[i]>>y[i];
        my_map[pair<int,int>(x[i],y[i])]=true;
    }
    for(int i=1;i<n;i++){
        if(fun(x[i-1],y[i-1],x[i],y[i])){
            count++;
        }
    }
    cout<<count<<endl;
    return 0;
}