Can you reach the score $$$\max(a) + \lceil n/2 \rceil$$$?

Can you reach the score $$$\max(a) + \lceil n/2 \rceil - 1$$$?

The maximum red element is $$$\leq \max(a)$$$, and the maximum number of red elements is $$$\lceil n/2 \rceil$$$. Can you reach the score $$$\max(a) + \lceil n/2 \rceil$$$?

• If $$$n$$$ is even, you always can, by either choosing all the elements in even positions or all the elements in odd positions (at least one of these choices contains $$$\max(a)$$$).
• If $$$n$$$ is odd, you can if and only if there is one occurrence of $$$\max(a)$$$ in an odd position. Otherwise, you can choose even positions and your score is $$$\max(a) + \lceil n/2 \rceil - 1$$$.

Complexity: $$$O(n)$$$

Can you determine fast how many intervals contain point $$$p$$$?

The intervals that contain point $$$p$$$ are the ones with $$$l \leq p$$$ and $$$r \geq p$$$.

Determine how many intervals contain:

• point $$$x_1$$$;
• points $$$x_1 + 1, \ldots, x_2 - 1$$$;
• point $$$x_2$$$;
• $$$\ldots$$$
• point $$$x_n$$$.

First, let's focus on determining how many intervals contain some point $$$x$$$. These intervals are the ones with $$$l \leq x$$$ and $$$x \leq r$$$.

So a point $$$x_i < p < x_{i+1}$$$ satisfies $$$x_1 \leq p, \ldots, x_i \leq p$$$, and $$$p \leq x_{i+1}, \ldots, p \leq x_n$$$. It means that you have found $$$x_{i+1} - x_i - 1$$$ points contained in exactly $$$i(n-i)$$$ intervals (because there are $$$i$$$ possible left endpoints and $$$n-i$$$ possible right endpoints).

Similarly, the point $$$p = x_i$$$ is contained in $$$i(n-i+1) - 1$$$ intervals (you have to remove interval $$$[x_i, x_i]$$$, which you do not draw).

So you can use a map that stores how many points are contained in exactly $$$x$$$ intervals, and update the map in the positions $$$i(n-i)$$$ and $$$i(n-i+1) - 1$$$.

Complexity: $$$O(n \log n)$$$

The answer is at most $$$n$$$.

Solve the problem with $$$k = 0$$$.

When is the answer $$$n$$$?

If the answer is not $$$n$$$, how can you buy cards?

Note that there are $$$n$$$ types of cards, so the subsets have size at most $$$n$$$, and the answer is at most $$$n$$$.

If $$$k = 0$$$, you can make subsets of size $$$s$$$ if and only if the following conditions are true:

• the number of cards ($$$m$$$) is a multiple of $$$s$$$;
• the maximum number of cards of some type ($$$x$$$) is $$$\leq m/s$$$.

For a generic $$$k$$$, the answer is $$$n$$$ if you can make the number of cards of type $$$1, \ldots, n$$$ equal. Otherwise, for any choice of number of cards to buy, you can buy them without changing $$$x$$$. It means that you need $$$x \cdot s$$$ cards in total:

• if you have less than $$$x \cdot s$$$ cards, you have to check if you can reach $$$x \cdot s$$$ cards by buying at most $$$k$$$ new cards;
• if you already have $$$x \cdot s$$$ or more cards at the beginning, you have to check if you can make $$$m$$$ a multiple of $$$s$$$.

Complexity: $$$O(n)$$$

When is the answer $$$0$$$?

Starting from city $$$x$$$ is equivalent to setting $$$a_x = 1$$$.

At some time $$$t$$$, consider the minimal interval $$$[l, r]$$$ that contains all the cities with $$$a_i \leq t$$$ (let's call it "the minimal interval at time $$$t$$$"). If this interval has length $$$> t$$$, the answer is $$$0$$$.

Otherwise, the answer is at least $$$1$$$. A possible construction is visiting the cities in order of $$$a_i$$$ (extending the interval until you reach the city you want to visit). In this way, at time $$$t$$$ you will have conquered all the cities in the minimal interval at time $$$t$$$ (which is short enough), and possibly other cities.

Starting from city $$$x$$$ is equivalent to setting $$$a_x = 1$$$. After this operation, you have to guarantee that, for each $$$i$$$, the minimal interval at time $$$t$$$ is short enough. If this interval is $$$[l, r]$$$ before the operation, $$$x$$$ must be contained in $$$[r-t+1, l+t-1]$$$. So it's enough to calculate and intersect the intervals obtained at $$$t = 1, \ldots, n$$$, and print the length of the final interval.

Another correct solution is to intersect the intervals $$$[i-a_i+1, i+a_i-1]$$$. The proof is contained in the editorial of 2018F3 - Speedbreaker Counting (Hard Version).

Complexity: $$$O(n)$$$

Solve for a fixed final depth of the leaves.

Which nodes are "alive" if all leaves are at depth $$$d$$$ at the end?

If the final depth of the leaves is $$$d$$$, it's optimal to keep in the tree all the nodes at depth $$$d$$$ and all their ancestors. These nodes are the only ones which satisfy the following two conditions:

• their depth ($$$a_i$$$) is $$$\leq d$$$;
• the maximum depth of a node in their subtree ($$$b_i$$$) is $$$\geq d$$$.

So every node is alive in the interval of depths $$$[a_i, b_i]$$$. The optimal $$$d$$$ is the one contained in the maximum number of intervals.

The optimal subsequence must contain at least one occurrence of the maximum.

Iterate over the minimum, in decreasing order.

You have some "connected components". How many elements can you pick from each component? How to make sure you have picked at least one occurrence of the maximum?

The optimal subsequence must contain at least one occurrence of the maximum ($$$r$$$) (suppose it doesn't; then you can just add one occurrence, at the cost of removing at most two elements, and this does not make your score smaller).

Now you can iterate over the minimum value ($$$l$$$), in decreasing order. At any moment, you can pick elements with values $$$[l, r]$$$. Then you have to support queries "insert pick-able element" and "calculate score".

The pick-able elements make some "connected components" of size $$$s$$$, and you can pick $$$\lceil s/2 \rceil$$$ elements. You can maintain the components with a DSU.

You also want to pick an element with value $$$r$$$. For each component, check if it contains $$$r$$$ in a subsequence with maximum size. If this does not happen for any component, your score decreases by $$$1$$$. All this information can be maintained by storing, for each component, if it contains $$$r$$$ in even positions, and if it contains $$$r$$$ in odd positions.

Complexity: $$$O(n \alpha(n))$$$

Solve for a fixed $$$m$$$ (size of the subsets).

$$$m = 1$$$ is easy. Can you do something similar for other $$$m$$$?

Solve for a fixed $$$k$$$ (number of subsets).

If you have a $$$O(n \log n)$$$ solution for a fixed $$$m$$$, note that there exists a faster solution!

Let's write a function max_k(m), which returns the maximum $$$k$$$ such that there exists a partition of $$$k$$$ valid sets containing $$$m$$$ intervals each. max_k works in $$$O(n \log n)$$$ in the following way (using a lazy segment tree):

• (wlog) $$$r_i \leq r_{i+1}$$$;
• for each $$$i$$$ not intersecting the previous subset, add $$$1$$$ on the interval $$$[l[i], r[i]]$$$;
• as soon as a point belongs to $$$m$$$ intervals, they become a subset;
• return the number of subsets.

For a given $$$k$$$, you can binary search the maximum $$$m$$$ such that max_k(m) $$$\geq k$$$ in $$$O(n \log^2 n)$$$.

The problem asks for the maximum $$$mk$$$. Since $$$mk \leq n$$$, for any constant $$$C$$$ either $$$m \leq C$$$ or $$$k \leq n/C$$$. For $$$C = (n \log n)^{1/2}$$$, the total complexity becomes $$$O((n \log n)^{3/2})$$$, which is enough to solve 2018E1 - Complex Segments (Easy Version). You can also find max_k(m) for all $$$m$$$ with a divide and conquer approach, and the complexity becomes $$$O(n \sqrt n \log n)$$$ (see here).

Now let's go back to max_k(m). It turns out you can implement it in $$$O(n \alpha(n))$$$.

First of all, let's make all the endpoints distinct, in such a way that two intervals intersect if and only if they were intersecting before.

Let's maintain a binary string of size $$$n$$$, initially containing only ones, that can support the following queries:

• set bit in position $$$p$$$ to 0;
• find the nearest 1 to the left of position $$$p$$$.

This can be maintained with DSU, where the components are the maximal intervals containing 100...00.

Now let's reuse the previous solution (sweeping $$$r$$$ from left to right), but instead of a segment tree we will maintain a binary string with the following information:

• the positions $$$> r$$$ store 1;
• the positions $$$\leq r$$$ store 1 if and only if the value in that position (in the previous solution) is a suffix max.

So the queries become:

• add $$$1$$$ to $$$[l, r]$$$:
• • $$$r$$$ changes, so you have to set elements in $$$[r'+1, r-1]$$$ to $$$0$$$;
• • the only other element that changes is the nearest 1 to the left of position $$$l$$$, which does not represent a suffix max anymore.
• find the maximum: it's equal to the number of suffix maximums, which depends on $$$r$$$ and on the number of components.

This solution allows us to replace a $$$O(\log n)$$$ factor with a $$$O(\alpha(n))$$$ factor.

Complexity: $$$O(n \sqrt n \alpha(n))$$$

[Bonus: there exists a data structure faster than DSU to solve the subproblem above, so you can solve the problem in $$$O(n \sqrt n)$$$. See here.]

Suppose you are given a starting city and you want to win. Find several strategies to win (if possible) and try to work with the simplest ones.

The valid starting cities are either zero, or all the cities in $$$I := \cap_{i=1}^n [i - a_i + 1, i + a_i - 1] = [l, r]$$$.

Now you have some bounds on the $$$a_i$$$.

Fix the interval $$$I$$$ and try to find a (slow) DP.

Counting paths seems easier than counting arrays. Make sure that, for each array, you make exactly one path (or a number of paths which is easy to handle).

How many distinct states do you calculate in your DP?

Lemma 1

For a fixed starting city, if you can win, this strategy works:

• [Strategy 1] If there is a city on the right whose distance is $$$t$$$ and whose deadline is in $$$t$$$ turns, go to the right. Otherwise, go to the left.

Proof:

• All constraints on the right hold.
• This strategy minimizes the time to reach any city on the left. So, if any strategy works, this strategy works too.

Corollary

For a fixed starting city, if you can win, this strategy works:

• [Strategy 2] If there is a city whose distance is $$$t$$$ and whose deadline is in $$$t$$$ turns, go to that direction. Otherwise, go to any direction.

Lemma 2

The valid starting cities are either zero, or all the cities in $$$I := \cap_{i=1}^n [i - a_i + 1, i + a_i - 1] = [l, r]$$$.

Proof:

• The cities outside $$$I$$$ are losing, because there exists at least one unreachable city.
• Let's start from any city $$$x$$$ in $$$I$$$, and use Strategy 2.
• You want to show that, for any $$$x$$$ in $$$I$$$, Strategy 2 can visit all cities in $$$I$$$ first, then all the other cities. Then, you can conclude that either all the cities in $$$I$$$ are winning, or they are all losing.
• The interval $$$I$$$ gives bounds on the $$$a_i$$$: specifically, $$$a_i \geq \max(i-l+1, r-i+1)$$$. Then, you can verify that visiting the interval $$$I$$$ first does not violate Strategy 2.

Corollary

If you use Strategy 1, the first move on the right determines $$$l$$$.

$$$\LARGE O(n^4)$$$ DP

Let's iterate on the (non-empty) interval $$$I$$$. Let's calculate the bounds $$$a_i \geq \max(i-l+1, r-i+1)$$$. Note that Strategy 1 is deterministic (i.e., it gives exactly one visiting order for each fixed pair (starting city, $$$a$$$)). From now, you will use Strategy 1.

Now you will calculate the number of pairs ($$$a$$$, visiting order) such that the cities in $$$I$$$ are valid starting cities (and there might be other valid starting cities).

Let's define dp[i][j][k] = number of pairs ($$$a$$$, visiting order), restricted to the interval $$$[i, j]$$$, where $$$k =$$$ "are you forced to go to the right in the next move?". Here are the main ideas to find the transitions:

• If you go from $$$[i+1, j]$$$ to $$$[i, j]$$$, you must ensure that $$$a_i \geq \max(i-l+1, r-i+1, j-i+1)$$$ (because you visit it at time $$$j-i+1$$$). Also, $$$k$$$ must be $$$0$$$.
• If you go from $$$[i, j-1]$$$ to $$$[i, j]$$$, and you want to make $$$k = 0$$$, you must make $$$a_j = j-i+1$$$. It means that $$$j$$$ was the city that was enforcing you to go to the right.

In my code, the result is stored in int_ans[i][j].

Now you want to calculate the number of pairs ($$$a$$$, visiting order) such that the cities in $$$I$$$ are the only valid starting cities. This is similar to 2D prefix sums, and it's enough to make int_ans[i][j] -= int_ans[i - 1][j] + int_ans[i][j + 1] - int_ans[i - 1][j + 1].

Since, for a fixed $$$a$$$, the visiting order only depends on the starting city, the number of $$$a$$$ for the interval $$$[i, j]$$$ is now int_ans[i][j] / (j - i + 1).

You have solved $$$k \geq 1$$$. The answer for $$$k = 0$$$ is just $$$n^n$$$ minus all the other answers.

$$$\LARGE O(n^3)$$$ DP

In the previous section, you are running the same DP for $$$O(n^2)$$$ different "bound arrays" on the $$$a_i$$$ (in particular, $$$O(n)$$$ arrays for each $$$k$$$). Now you want to solve a single $$$k$$$ with a single DP.

For a fixed $$$k$$$, you can notice that, if you run the DP on an array of length $$$2n$$$ instead of $$$n$$$, the bound array obtained from $$$I = [n-k+1, n]$$$ contains all the bound arrays you wanted as subarrays of length $$$n$$$. So you can run the DP and get all the results as dp[i][i + n - 1][0].

$$$\LARGE O(n^2)$$$ DP

You still have $$$O(n^3)$$$ distinct states in total. How to make "bound arrays" simpler?

It turns out that you can handle $$$l$$$ and $$$r$$$ differently! You can create bound arrays only based on $$$r$$$ (and get $$$O(n^2)$$$ distinct states), and find $$$l$$$ using the Corollary of Lemma 2. The transitions before finding $$$l$$$ are very simple (you always go to the left). So a possible way to get $$$O(n^2)$$$ complexity is processing Strategy 1 and the DP in reverse order (from time $$$n$$$ to time $$$1$$$).

Complexity: $$$O(n^2)$$$