Answer the question
In order to leave comments, you need to log in
Is there a scheme for searching for the maximum in the frame array in one cycle?
This is the so-called frog problem. The frog eats flies. She is the main task of air defense
Answer the question
In order to leave comments, you need to log in
Why create an array if the nearest one is destroyed? All the same, the array in the hardware is not created in one clock cycle, and after a frame the data will become irrelevant. Already at the stage of the frame data arrival (of course, if the frame is finite - for example, a 360 degree view) select the closest fly. As I understand it, if it is really - "frame" - then the frames will arrive continuously (the review is underway). But seriously, it is probably necessary to monitor dangerous objects, and not the nearest ones. Those. if the "fly" approaches at a greater speed than the others, then at a certain distance it becomes a target.
By the way, similar tasks were set on codingame. And they probably did.
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question