Program Programming Programmer

  • 홈
  • 방명록
  • 관리자
  • 글쓰기

convex hull 2

BAEKJOON 2700 - Interior Points of Lattice Polygons

문제: https://www.acmicpc.net/problem/2700 문제A lattice point is a point with integer coordinates. A lattice polygon is a polygon with all vertices lattice points. The lattice points on the boundary of the polygon are boundary points (open dots in the figure above) and the points inside and not on the polygon are interior points (filled in dots in the figure above). A polygon is convex if any line ..

Algorithm, Data structure/Solved Algorithmic Problem 2016.12.21

BAEKJOON 2699 - Convex Hull of Lattice Points

문제: https://www.acmicpc.net/problem/2699 문제A lattice point is a point with integer coordinates. A lattice polygon is a polygon with all vertices lattice points. A polygon is convex if any line segment between two points of the polygon is inside (or on the boundary of) the polygon. Equivalently, the interior angle at each polygon vertex is less than 180 degrees. For a set S, of lattice points, th..

Algorithm, Data structure/Solved Algorithmic Problem 2016.12.11
이전
1
다음
더보기
프로필사진

Program Programming Programmer

프로그래머

  • 분류 전체보기 (142)
    • Deep learning (17)
    • Python (0)
    • Algorithm, Data stru.. (125)
      • Solved Algorithmic P.. (120)
      • Popular Algorithms (3)
      • Basic concepts (2)

Tag

Shoelace Formula, bipartite matching, GREEDY, Math, Erathosthenes, Simulation, Divide And Conquer, dynamic programming, dfs, bit mask, convex hull, binary search, Base Conversion, sort, binomial coefficient, Deterministic finite automaton, memoization, string, Josephus, Complete Search,

최근글과 인기글

  • 최근글
  • 인기글

최근댓글

공지사항

페이스북 트위터 플러그인

  • Facebook
  • Twitter

Archives

Calendar

«   2025/07   »
일 월 화 수 목 금 토
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31

방문자수Total

  • Today :
  • Yesterday :

Copyright © Kakao Corp. All rights reserved.

티스토리툴바