weixin_43740907的博客

题意：从起点石头到终点石头之间有N块石头，给出每个石头到起点的距离（每个石头的位置不相同），现在你可以移除m个石头，使石头之间的最小距离最大 对于这种情况我们可以二分找答案，然后判断答案是否符合条件，具体判断方法代码旁边有注释 #include<stdio.h> #include<string.h> #include<algorithm> using na...

The Berland Army is preparing for a large military parade. It is already decided that the soldiers participating in it will be divided intokkrows, and all rows will containthe samenumber of soldie...

For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the container is to support t...

Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤moneyi≤ 10,000) that h...