Need help on this problem

Правка en1, от SkyMagic, 2024-11-24 13:57:26

The problem is basically monopoly but you don't need to roll dices or stuffs, we have $$$N$$$ $$$(1 \leq N \leq 10^5)$$$ positions each of which are all empty. We can play any number of rounds by each rounds we choose an index $$$i$$$, if it's empty, we'll build a house on that position which will cost us $$$A_i$$$, and gives us 1 points, but if it's a house already, we'll build a apartment, which will cost us $$$B_i$$$, and gives us 1 points

Теги problem, optimization, dp

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en9 Английский SkyMagic 2024-11-24 16:06:16 26
en8 Английский SkyMagic 2024-11-24 14:23:26 1705 (published)
en7 Английский SkyMagic 2024-11-24 14:21:59 295
en6 Английский SkyMagic 2024-11-24 14:16:26 389
en5 Английский SkyMagic 2024-11-24 14:10:01 6
en4 Английский SkyMagic 2024-11-24 14:09:51 259
en3 Английский SkyMagic 2024-11-24 14:07:06 2 Tiny change: 'e $Q$ $(1 leq Q leq 10^5)$' -> 'e $Q$ $(1 \leq Q \leq 10^5)$'
en2 Английский SkyMagic 2024-11-24 14:05:50 464
en1 Английский SkyMagic 2024-11-24 13:57:26 451 Initial revision (saved to drafts)