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
- 이베이트
- Algorithm
- indexed tree
- gallian
- subgroup
- round 424
- round 420
- algebra
- 구간쿼리
- 알고리즘
- 아시아나
- Codeforces
- Ebate USA
- ccw
- acmicpc
- 이베이트코리아
- self balancing binary search tree
- 이베이트미국
- 대한항공
- Ebate Korea
- Algebraic Geometry
- 대수학
- BOJ
- persistent segment tree
- finite group
- 백준
- persistent indexed tree
- 마일리지
- 7469
- k번째 수
Archives
- Today
- Total
목록Div2 E (1)
[Round#424 Div2] E. Cards Sorting
http://codeforces.com/contest/831/problem/E E. Cards Sortingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily has a deck of cards consisting of n cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on them.Vasily decided to sort the cards...
Algorithm/CodeForces
2017. 7. 16. 00:51