일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Algebraic Geometry
- indexed tree
- 이베이트미국
- k번째 수
- algebra
- Ebate USA
- 대수학
- finite group
- 알고리즘
- 대한항공
- 이베이트코리아
- subgroup
- Ebate Korea
- gallian
- round 424
- 이베이트
- persistent indexed tree
- acmicpc
- ccw
- Algorithm
- Codeforces
- persistent segment tree
- round 420
- 구간쿼리
- 7469
- BOJ
- 아시아나
- 백준
- 마일리지
- self balancing binary search tree
- Today
- Total
목록round 424 (2)
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...
http://codeforces.com/problemset/problem/831/C C. Jury Markstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one..