|Codeforces Round #462 (Div. 1)|
East or west, home is best. That's why family reunion, the indispensable necessity of Lunar New Year celebration, is put in such a position.
After the reunion dinner, Little Tommy plays a game with the family. Here is a concise introduction to this game:
Obviously, every game ends after at most n - 1 descensions. Please share your solution of this game with the lowest cost.
The first line contains one integer n (1 ≤ n ≤ 3·105).
The second line contains n space-separated integers p1, p2, ..., pn (0 ≤ pi ≤ 109, i = 1, 2, ..., n).
In the first line print one integer as the number of descensions m (0 ≤ m ≤ n - 1).
In the next m lines print the descensions chronologically. More precisely, in each line of the next m lines print one integer i (1 ≤ i < n) representing a descension would operate on pi and pi + 1 such that all the descensions could be utilized from top to bottom.
If there are many possible solutions to reach the minimal cost, print any of them.
2 1 3 1
2 2 1 3 1
In the first sample, one possible best solution is , of which the cost is 1 + 1 = 2.
In the second sample, one possible best solution is , of which the cost is 1 + 1 + 1 = 3.