526互联

carrot

Codeforces Round 809 (Div. 2) D1. Chopping Carrots (Easy Version) 题解

题意 Codeforces Round 809 (Div. 2) D1. Chopping Carrots (Easy Version) 给两个整数\(n, k\), 一个数组 \(a\), 要求构造一个同样长度的数组 \(p\), 使得 \(\max\limits_{1 \le i \le n}\ ......
题解 Codeforces Chopping Carrots Version

胡萝卜问题 Carrot Problems

![](https://img2023.cnblogs.com/blog/474029/202308/474029-20230814202557915-1954441632.png) ![](https://img2023.cnblogs.com/blog/474029/202308/474029- ......
胡萝卜 Problems Carrot 问题
共2篇  :1/1页 首页上一页1下一页尾页