BOJ 14165 Team Building
문제 링크 : https://www.acmicpc.net/problem/14165 14165번: Team Building Every year, Farmer John brings his N cows to compete for "best in show" at the state fair. His arch-rival, Farmer Paul, brings his M cows to compete as well (1≤N≤1000,1≤M≤1000). Each of the N+M cows at the event receive an individual integer score. www.acmicpc.net 문제를 이해하는데 어려움을 겪었다. 설명에 등장하는 다음 문장 That is, each distinct pair (s..
DS\Algo/Dynamic Programming
2022. 8. 20. 14:30
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- JavaScript
- 백준
- shell
- stack
- Reference
- BOJ
- script
- Aho-Corasick
- max flow
- number theory
- C++ big number
- 세그먼트 트리
- nearest common ancestor
- math font
- segment tree
- bash script
- python3
- Dijkstra
- bash
- lazy propagation
- fenwick tree
- Vim
- 정수론
- persistent segment tree
- javascript array
- map
- dynamic programming
- 다익스트라
- RUBY
- Shell Programming
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
글 보관함