HBC222897[NOIP2003]栈,数学,动态规划,NOIP复赛Jerry题解

题库丰富多样，涵盖各个领域，全网最全C++题库，让您在练习中不断成长！

distance in front of the initial position. Next, there are. qquestions, each time asking how much rice at least it takes for Jerry to move forward. .Note that each question is an independent one.

Although Jerry is a mouse, he likes perfect square numbers. If a number can be expressed as the square of an integer, it is called perfect square numbers. Jerry can use magic to move forward or backward a distance of any perfect square numbers, which costs a grain of rice each time. And the position after each use of magic can not be behind the initial position or more than  10^5 10 5  distance in front of the initial position. Next, there are  q q questions, each time asking how much rice at least it takes for Jerry to move forward  d_i d i ​ .Note that each question is an independent one.

成为编程大师，不再是梦想！全网最全C++题库，助您开启编程新篇章。

标签： HBC222897[NOIP2003]栈 数学 动态规划 NOIP复赛Jerry题解