일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- algebra
- self balancing binary search tree
- Ebate Korea
- 대한항공
- finite group
- 아시아나
- 구간쿼리
- subgroup
- persistent segment tree
- 이베이트코리아
- 대수학
- acmicpc
- 이베이트
- round 424
- Codeforces
- BOJ
- Algebraic Geometry
- Ebate USA
- round 420
- persistent indexed tree
- Algorithm
- 마일리지
- gallian
- 알고리즘
- indexed tree
- k번째 수
- 7469
- 이베이트미국
- ccw
- 백준
- Today
- Total
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..
http://codeforces.com/problemset/problem/909/C C. Python Indentationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Python, code blocks don't have explicit begin/end or curly braces to mark beginning and end of the block. Instead, code blocks are defined by indentation.We will consider an extremely simplified subset of Python with only two..
http://codeforces.com/problemset/problem/900/CC. Remove Extra Onetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output You are given a permutation p of length n. Remove one element from permutation to make the number of records the maximum possible.We remind that in a sequence of numbers a1, a2, ..., ak the element ai is a record if for every inte..