该博客探讨了CodeForces中的一道题目924C（Riverside Curio），涉及河流水位与标记线的关系。博主解释了如何计算每天水位线下方标记线的最小总数，通过转化问题为最小化累计标记数，并使用贪心和动态规划策略来解决。文章包含实例和解题思路。
https://blog.csdn.net/lzc504603913/article/details/79702604
https://codeforces.com/contest/957/problem/D
Riverside Curio
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Arkady decides to observe a river for n consecutive days. The river's water level on each day is equal to some real value.
Arkady goes to the riverside each day and makes a mark on the side of the channel at the height of the water level, but if it coincides with a mark made before, no new mark is created. The water does not wash the marks away. Arkady writes down the number of marks strictly above the water level each day, on the i-th day this value is equal to mi.
Defi
最低0.47元/天 解锁文章
扫一扫
246
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
