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 descri...

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...

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 segm...

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 ...

Codeforces 1082C - Multi-Subject Competition - 暴力 题解链接 https://lucien.ink 题目链接 https://codeforces.com/contest/1082/problem/C 题目 A multi-subject competition is coming! The competition has ...

Codeforces 1082B - Vova and Trophies 题解链接 https://lucien.ink 题目链接 https://codeforces.com/contest/1082/problem/B 题目   Vova has won $n$ trophies in different competitions. Each trophy is ei...

Codeforces 1082A - Vasya and Book 题解链接 https://lucien.ink 题目链接 https://codeforces.com/contest/1082/problem/A 题目   Vasya is reading a e-book. The file of the book consists of $n$ pages, nu...

前言 我是菜鸡，如有不对的地方烦请指正。 起始 上周（好像是上周）的时候操作系统的老师抛出了一个问题留给我们： 对以下程序在一台主流配置 的PC上，调用f(36)所需要 的时间大概是多少？请给出时间估算的依据并对程序的执行情况进行详细的解析说明。 int f(int x) { int s = 0; while (x++ > 0) s += f(x); r...

题目链接 https://nanti.jisuanke.com/t/31462 题目 After the long vacation, the maze designer master has to do his job. A tour company gives him a map which is a rectangle. The map consists of $N \tim...

题目链接 https://nanti.jisuanke.com/t/31445 题目 One day in the jail, F·F invites Jolyne Kujo (JOJO in brief) to play tennis with her. However, Pucci the father somehow knows it and wants to stop he...