Codeforces 1082F - Speed Dial - 动态规划题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/F题目Polycarp's phone book contains $n$ phone numbers, each of them is described by $s_i$ — t...
Codeforces 1082G - Petya and Graph - 网络流题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/G题目Petya has a simple graph (that is, a graph without loops or multiple edges) consisti...
Codeforces 1082E - Increasing Frequency - 动态规划题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/E题目You are given array $a$ of length $n$. You can choose one segment $[l, r]$ ($1...
Codeforces 1082D - Maximum Diameter Graph - 贪心题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/D题目Graph constructive problems are back! This time the graph you are asked to bui...
Codeforces 1082C - Multi-Subject Competition - 暴力题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/C题目A multi-subject competition is coming! The competition has $m$ different su...