Cow Steeplechase timer 1초 memory 128MB

Farmer John has a brilliant idea for the next great spectator sport: Cow Steeplechase! As everyone knows, regular steeplechase involves a group of horses that race around a course filled with obstacles they must jump over.

FJ figures the same contest should work with highly-trained cows, as long as the obstacles are made short enough.

In order to design his course, FJ makes a diagram of all the N (1 <= N <= 250) possible obstacles he could potentially build. 

Each one is represented by a line segment in the 2D plane that is parallel to the horizontal or vertical axis. Obstacle i has distinct endpoints (X1_i, Y1_i) and (X2_i, Y2_i) (1 <= X1_i, Y1_i, X2_i, Y2_i <= 1,000,000,000). An example is as follows:

   --+-------   

-----+-----

  ---+---     |

     |     |  |

   --+-----+--+-   |

     |     |  |  | |

     |   --+--+--+-+-

           |  |  | |

              |

FJ would like to build as many of these obstacles as possible, subject to

the constraint that no two of them intersect. Starting with the diagram

above, FJ can build 7 obstacles:

   ----------   

-----------

  -------     |

           |  |

           |  |    |

           |  |  | |

           |  |  | |

           |  |  | |

              |

Two segments are said to intersect if they share any point in common, even an endpoint of one or both of the segments.  FJ is certain that no two horizontal segments in the original input diagram will intersect, and that similarly no two vertical segments in the input diagram will intersect.

Please help FJ determine the maximum number of obstacles he can build.​