Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- 알고리즘
- 마일리지
- Algebraic Geometry
- 대수학
- 구간쿼리
- algebra
- 이베이트
- round 420
- finite group
- 대한항공
- 백준
- Codeforces
- self balancing binary search tree
- 아시아나
- Algorithm
- indexed tree
- persistent indexed tree
- acmicpc
- k번째 수
- Ebate USA
- 이베이트코리아
- persistent segment tree
- round 424
- BOJ
- ccw
- Ebate Korea
- 7469
- 이베이트미국
- subgroup
- gallian
Archives
- Today
- Total
목록Implementation (1)
[Round#455 Div2] D. Colorful Points
http://codeforces.com/problemset/problem/909/D D. Colorful Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one fro..
Algorithm/CodeForces
2018. 1. 4. 17:58