CF1791G1 Teleporters (Easy Version)

Description

The only difference between the easy and hard versions are the locations you can teleport to. Consider the points $ 0, 1, \dots, n $ on the number line. There is a teleporter located on each of the points $ 1, 2, \dots, n $ . At point $ i $ , you can do the following: - Move left one unit: it costs $ 1 $ coin. - Move right one unit: it costs $ 1 $ coin. - Use a teleporter at point $ i $ , if it exists: it costs $ a_i $ coins. As a result, you teleport to point $ 0 $ . Once you use a teleporter, you can't use it again. You have $ c $ coins, and you start at point $ 0 $ . What's the most number of teleporters you can use?

Input Format

N/A

Output Format

N/A

Explanation/Hint

In the first test case, you can move one unit to the right, use the teleporter at index $ 1 $ and teleport to point $ 0 $ , move two units to the right and use the teleporter at index $ 2 $ . You are left with $ 6-1-1-2-1 = 1 $ coins you don't have enough coins to use another teleporter. You have used two teleporters, so the answer is two. In the second test case, you go four units to the right and use the teleporter to go to $ 0 $ , then go six units right and use the teleporter at index $ 6 $ to go to $ 0 $ . The total cost will be $ 4+6+6+4 = 20 $ . You are left with $ 12 $ coins, but it is not enough to reach any other teleporter and use it so the answer is $ 2 $ . In the third test case, you don't have enough coins to use any teleporter, so the answer is zero.