【题解】codeforces1029B[Codeforces Round #506 (Div. 3)]B.Creating the Contest 贪心

题目链接

Description

You are given a problemset consisting of $n$ problems. The difficulty of the $i$-th problem is $a_i$. It is guaranteed that all difficulties are distinct and are given in the increasing order.

You have to assemble the contest which consists of some problems of the given problemset. In other words, the contest you have to assemble should be a subset of problems (not necessary consecutive) of the given problemset. There is only one condition that should be satisfied: for each problem but the hardest one (the problem with the maximum difficulty) there should be a problem with the difficulty greater than the difficulty of this problem but not greater than twice the difficulty of this problem. In other words, let $a_{i_1},a_{i_2},\cdots ,a_{i_p}$ be the difficulties of the selected problems in increasing order. Then for each