20066번 - Meetings 서브태스크다국어언어 제한함수 구현

There are N mountains lying in a horizontal row, numbered from 0 through N - 1from left to right. The height of the mountain i is H_i (0 ≤ i ≤ N - 1). Exactly one person lives on the top of each mountain.

You are going to hold Q meetings, numbered from 0 through Q - 1. The meeting j (0 ≤ j ≤ Q - 1) will be attended by all the people living on the mountains from L_j to R_j, inclusive (0 ≤ L_j ≤ R_j ≤ N - 1). For this meeting, you must select a mountain x as the meeting place (L_j ≤ x ≤ R_j). The cost of this meeting, based on your selection, is then calculated as follows:

• The cost of the participant from each mountain y (L_j ≤ y ≤ R_j) is the maximum height of the mountains between the mountains x and y, inclusive. In particular, the cost of the participant from the mountain x is H_x, the height of the mountain x.
• The cost of the meeting is the sum of the costs of all participants.

For each meeting, you want to find the minimum possible cost of holding it.

Note that all participants go back to their own mountains after each meeting; so the cost of a meeting is not influenced by the previous meetings.

You should implement the following function:

int64[] minimum_costs(int[] H, int[] L, int[] R)

• H: an array of length N, representing the heights of the mountains.
• L and R: arrays of length Q, representing the range of the participants in the meetings.
• This function should return an array C of length Q. The value of C_j (0 ≤ j ≤ Q - 1) must be the minimum possible cost of holding the meeting j.
• Note that the values of N and Q are the lengths of the arrays, and can be obtained as indicated in the implementation notice.

Let N = 4, H = [2, 4, 3, 5], Q = 2, L = [0, 1], and R = [2, 3].

The grader calls minimum_costs([2, 4, 3, 5], [0, 1], [2, 3]).

The meeting j = 0 has L_j = 0 and R_j = 2, so will be attended by the people living on the mountains 0, 1, and 2. If the mountain 0 is chosen as the meeting place, the cost of the meeting 0 is calculated as follows:

• The cost of the participant from the mountain 0 is max{H₀} = 2.
• The cost of the participant from the mountain 1 is max{H₀, H₁} = 4.
• The cost of the participant from the mountain 2 is max{H₀, H₁, H₂} = 4.
• Therefore, the cost of the meeting 0 is 2 + 4 + 4 = 10.

It is impossible to hold the meeting 0 at a lower cost, so the minimum cost of the meeting 0 is 10.

The meeting j = 1 has L_j = 1 and R_j = 3, so will be attended by the people living on the mountains 1, 2, and 3. If the mountain 2 is chosen as the meeting place, the cost of the meeting 1 is calculated as follows:

• The cost of the participant from the mountain 1 is max{H₁, H₂} = 4.
• The cost of the participant from the mountain 2 is max{H₂} = 3.
• The cost of the participant from the mountain 3 is max{H₂, H₃} = 5.
• Therefore, the cost of the meeting 1 is 4 + 3 + 5 = 12.

It is impossible to hold the meeting 1 at a lower cost, so the minimum cost of the meeting 1 is 12.

• 1 ≤ N ≤ 750,000
• 1 ≤ Q ≤ 750,000
• 1 ≤ H_i ≤ 1,000,000,000 (0 ≤ i ≤ N - 1)
• 0 ≤ L_j ≤ R_j ≤ N - 1 (0 ≤ j ≤ Q - 1)
• (L_j, R_j) ≠ (L_k, R_k) (0 ≤ j < k ≤ Q - 1)

The sample grader reads the input in the following format:

• line 1: N Q
• line 2: H₀ H₁ ... H_N-1
• line 3 + j (0 ≤ j ≤ Q - 1): L_j R_j

The sample grader prints the return value of minimum_costs in the following format:

• line 1 + j (0 ≤ j ≤ Q - 1): C_j

• meetings.h
• meetings.cpp
• grader.cpp
• sample-01.txt
• sample-02.txt
• sample-03.txt
• sample-04.txt