문제 www.acmicpc.net/problem/19456 19456번: Cocktails In the first line of input there are four space-separated integers n, k, B, C (1≤k≤n≤500, 1≤B,C≤10000) --- the number of jars, the reach of the blender, the time needed to use the blender, and the time needed to swap www.acmicpc.net 길이 N의 수열이 주어지고, 할수 있는 연산은 1. Ai의 비용으로 i번째 칸을 체크 2. B의 비용으로 연속된 k개..
문제 https://www.acmicpc.net/problem/10556 10556번: KAMIONI The first line of input contains the integers N and M (1 ≤ N ≤ 105, 1 6 M 6 105), the number of trucks and the number of pairs of trucks we want to know the number of encounters for. The ith of the following N lines contains the description of the rout www.acmicpc.net 어떤 한 트럭이 수직선 상에서 A1, A2, A3, A4, ... , An (A1>A2A4 ... or A1A3
문제 https://www.acmicpc.net/problem/10355 10355번: Most Influential Pumpkin Pumpkins in Hagrid's garden have come to life! Now they walk, talk, date … and, of course, organize elections to choose the Head Pumpkin! It turns out that it is pretty simple to guess who will win the next elections - it will be one of the pumpkins of t www.acmicpc.net 처음에 입력 수열 A가 주어지고, 각 쿼리마다 [l, r]에 1씩 더하고, 전체 수열의 중앙값을..
- Total
- Today
- Yesterday
- offline
- DFS
- Persistent Segment Tree
- stack
- Segment Tree
- Floyd-Warshall
- Shortest path
- Merge Sort
- Sqrt Decomposition
- Centroid Decomposition
- BOJ
- Sparse Table
- Fenwick Tree
- Codeforces
- Divide & Conquer
- CHT
- Parametric Search
- Greedy
- ⭐
- Union Find
- ioi
- APIO
- Lazy Propagation
- graph
- convex hull
- DP
- tree
- Line sweeping
- HLD
- Interactive
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |