How to read the YAN report?

Question

C++ / C#

A little confused in the interpretation of the report, namely:

Report

1) CPM - this is the price per 1000 impressions for the advertiser, the report uses RPM (what the webmaster receives) is almost the same, only less than what Yandex takes!?
With a blue square, I canceled the lines where the strategy is set: "Minimum CPM" with a value of 10 rubles per 1000 impressions.
Question: what does CPM have to do with it, if there is no CPM in the report! It turns out that Yandex takes at least 10 rubles from the advertiser, but gives me less? In the RPM column, the values ​​in the 2 lines below are 10!!!

2) eCPM is basically the same as RPM, only it counts blocks that are not sold, for example:
eCPM= (RPM / renders) * Ad Requests = (16.65 / 29) * 31 = 17.80
the question is why this term at all? Those. Does Yandex compensate me for unsold blocks? Sounds a little crazy.

3) The reward is calculated based on CPMV, which is essentially the same eCPM, only taking into account "% visibility", it is calculated as: (Ad impressions * CPMV) / 1000 = (9 * 57.34) / 1000 = 0.52
Again, not completely understood, i.e. in this ad block: CPMV = 57.34, and RPM = 16.65
It turns out that Yandex compensates me not only for not sold, but also for not shown blocks?

And now let's take the first line of the report, % visibility = 90%, sold = 100%, good RPM = 54.42 rubles. But what we see is CPMV = 60.47 which is not much more than RPM.

And now the main question: CPMV serves to compensate for the RPM of not sold and not shown blocks. Why all this dregs, they make a small RPM, and then they pull it up to a more or less sane level ?! What for?

I assume that if I increase the % visibility, then the CPMV will fall, but the RPM will become larger.

In short, some kind of nonsense. Please help.
PS. The strategy costs "Maximum income", except for 3 "Blue Square" blocks - there is "Minimum CPM = 10".

Answer 1

Your task says that A[i] can equal MAXINT. Naturally, when you add i, you go beyond the integer type.
But, you know that N cannot be more than 100000. So it makes no sense to analyze beyond this limit.
rangeMax[i] = A[i] > 100000 ? 100001 : i + A[i];