일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 백준
- @P0
- 처우협의
- 기술면접
- BOJ
- 파라메트릭
- 이분탐색
- 연결요소
- 경력
- softeer
- incr
- 처우산정
- 6987
- 퇴사통보
- Docker
- upper_bound
- 오퍼레터
- 백트래킹
- Kafka
- OFFSET
- compose
- 매개변수탐색
- msSQL
- dfs
- BFS
- 성적평가
- 소프티어
- 물채우기
- boj #19237 #어른 상어
- 13908
- Today
- Total
목록알고리즘 문제/Codeforces (2)
기술 블로그
https://codeforces.com/contest/1339/problem/B https://codeforces.com/blog/entry/75913 B. Sorted Adjacent Differences You have array of n numbers a1,a2,…,an. Rearrange these numbers to satisfy |a1−a2|≤|a2−a3|≤…≤|an−1−an|, where |x| denotes absolute value of x. It's always possible to find such rearrangement. Note that all numbers in a are not necessarily different. In other words, some numbers of..
https://codeforces.com/contest/1333/problem/C binary search 이분 탐색 data structures 자료구조 hashing 해 implementation 실행 two pointers 투 포인터 C. Eugene and an array Eugene likes working with arrays. And today he needs your help in solving one challenging task. An array c is a subarray of an array b if c can be obtained from b by deletion of several (possibly, zero or all) elements from the beginning and..